./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/dirname-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:02:38,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:02:38,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:02:38,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:02:38,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:02:38,891 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:02:38,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:02:38,892 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:02:38,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:02:38,893 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:02:38,893 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:02:38,893 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:02:38,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:02:38,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:02:38,894 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:02:38,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:02:38,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:02:38,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:02:38,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:02:38,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:02:38,896 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> deade1e5790a25ffe3efe3f50079c7cd07ab83afaa52029d4373e6401cf093c7 [2025-02-06 12:02:39,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:02:39,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:02:39,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:02:39,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:02:39,114 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:02:39,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-02-06 12:02:40,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4ada652f/c0da90ad8600421ebe655ebbef09988e/FLAG33cd02287 [2025-02-06 12:02:40,663 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:02:40,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-02-06 12:02:40,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4ada652f/c0da90ad8600421ebe655ebbef09988e/FLAG33cd02287 [2025-02-06 12:02:40,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d4ada652f/c0da90ad8600421ebe655ebbef09988e [2025-02-06 12:02:40,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:02:40,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:02:40,706 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:02:40,706 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:02:40,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:02:40,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:02:40" (1/1) ... [2025-02-06 12:02:40,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:40, skipping insertion in model container [2025-02-06 12:02:40,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:02:40" (1/1) ... [2025-02-06 12:02:40,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:02:41,148 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:41,165 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:41,165 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:41,177 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:41,191 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:41,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:02:41,230 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:02:41,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:02:41,353 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:02:41,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41 WrapperNode [2025-02-06 12:02:41,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:02:41,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:02:41,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:02:41,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:02:41,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,409 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 648 [2025-02-06 12:02:41,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:02:41,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:02:41,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:02:41,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:02:41,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,456 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 3, 2, 3, 4, 4, 4, 4, 3, 44, 355, 2, 11, 6]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 3, 0, 3, 3, 3, 3, 3, 3, 42, 355, 0, 0, 0]. The 9 writes are split as follows [0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 2, 2, 2]. [2025-02-06 12:02:41,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:02:41,494 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:02:41,494 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:02:41,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:02:41,495 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (1/1) ... [2025-02-06 12:02:41,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:02:41,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:41,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:02:41,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:02:41,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 12:02:41,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 12:02:41,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 12:02:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-06 12:02:41,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:02:41,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:02:41,755 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:02:41,757 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:02:42,239 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: havoc single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset; [2025-02-06 12:02:42,257 INFO L? ?]: Removed 163 outVars from TransFormulas that were not future-live. [2025-02-06 12:02:42,257 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:02:42,265 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:02:42,265 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:02:42,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:02:42 BoogieIcfgContainer [2025-02-06 12:02:42,266 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:02:42,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:02:42,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:02:42,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:02:42,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:02:40" (1/3) ... [2025-02-06 12:02:42,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@999d3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:02:42, skipping insertion in model container [2025-02-06 12:02:42,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:41" (2/3) ... [2025-02-06 12:02:42,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@999d3f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:02:42, skipping insertion in model container [2025-02-06 12:02:42,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:02:42" (3/3) ... [2025-02-06 12:02:42,272 INFO L128 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2025-02-06 12:02:42,283 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:02:42,284 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dirname-1.i that has 2 procedures, 177 locations, 1 initial locations, 6 loop locations, and 74 error locations. [2025-02-06 12:02:42,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:02:42,322 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;@35c1264c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:02:42,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-02-06 12:02:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 177 states, 100 states have (on average 1.94) internal successors, (194), 174 states have internal predecessors, (194), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:02:42,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:42,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:02:42,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:42,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash 228357, now seen corresponding path program 1 times [2025-02-06 12:02:42,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:42,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210271563] [2025-02-06 12:02:42,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:42,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:42,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:02:42,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:02:42,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:42,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:42,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:42,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210271563] [2025-02-06 12:02:42,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210271563] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:42,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:42,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:42,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513536661] [2025-02-06 12:02:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:42,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:42,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:42,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:42,779 INFO L87 Difference]: Start difference. First operand has 177 states, 100 states have (on average 1.94) internal successors, (194), 174 states have internal predecessors, (194), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:42,901 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2025-02-06 12:02:42,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:42,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:02:42,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:42,907 INFO L225 Difference]: With dead ends: 137 [2025-02-06 12:02:42,907 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 12:02:42,908 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-06 12:02:42,910 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 140 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:42,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 95 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 12:02:42,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-06 12:02:42,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 134 states have internal predecessors, (149), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:42,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2025-02-06 12:02:42,934 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 3 [2025-02-06 12:02:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:42,934 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2025-02-06 12:02:42,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2025-02-06 12:02:42,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:02:42,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:42,934 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:02:42,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:02:42,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:42,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:42,935 INFO L85 PathProgramCache]: Analyzing trace with hash 228358, now seen corresponding path program 1 times [2025-02-06 12:02:42,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:42,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455753864] [2025-02-06 12:02:42,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:42,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:02:42,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:02:42,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:42,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:43,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:43,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455753864] [2025-02-06 12:02:43,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455753864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:43,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:43,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206926303] [2025-02-06 12:02:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:43,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:43,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:43,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:43,118 INFO L87 Difference]: Start difference. First operand 137 states and 151 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:43,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:43,197 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2025-02-06 12:02:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:43,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:02:43,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:43,198 INFO L225 Difference]: With dead ends: 136 [2025-02-06 12:02:43,198 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 12:02:43,198 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-06 12:02:43,199 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 6 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:43,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 230 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 12:02:43,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-02-06 12:02:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 80 states have (on average 1.85) internal successors, (148), 133 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 150 transitions. [2025-02-06 12:02:43,204 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 150 transitions. Word has length 3 [2025-02-06 12:02:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:43,204 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 150 transitions. [2025-02-06 12:02:43,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 150 transitions. [2025-02-06 12:02:43,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:02:43,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:43,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:02:43,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:02:43,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:43,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:43,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1786787394, now seen corresponding path program 1 times [2025-02-06 12:02:43,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:43,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406642155] [2025-02-06 12:02:43,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:43,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:43,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:02:43,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:02:43,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:43,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:43,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406642155] [2025-02-06 12:02:43,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406642155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:43,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:43,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:43,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005143360] [2025-02-06 12:02:43,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:43,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:02:43,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:43,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:02:43,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:02:43,451 INFO L87 Difference]: Start difference. First operand 136 states and 150 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-06 12:02:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:43,546 INFO L93 Difference]: Finished difference Result 139 states and 153 transitions. [2025-02-06 12:02:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:02:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-06 12:02:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:43,547 INFO L225 Difference]: With dead ends: 139 [2025-02-06 12:02:43,547 INFO L226 Difference]: Without dead ends: 139 [2025-02-06 12:02:43,548 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-06 12:02:43,548 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:43,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 228 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-06 12:02:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2025-02-06 12:02:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 82 states have (on average 1.829268292682927) internal successors, (150), 135 states have internal predecessors, (150), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 152 transitions. [2025-02-06 12:02:43,553 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 152 transitions. Word has length 6 [2025-02-06 12:02:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:43,554 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 152 transitions. [2025-02-06 12:02:43,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-06 12:02:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 152 transitions. [2025-02-06 12:02:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:02:43,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:43,554 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:43,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:02:43,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:43,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:43,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1641541185, now seen corresponding path program 1 times [2025-02-06 12:02:43,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:43,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853600337] [2025-02-06 12:02:43,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:43,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:43,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:02:43,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:02:43,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:43,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:43,808 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-06 12:02:43,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:43,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853600337] [2025-02-06 12:02:43,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853600337] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:43,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368241343] [2025-02-06 12:02:43,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:43,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:43,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:43,811 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-06 12:02:43,813 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-06 12:02:43,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:02:43,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:02:43,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:43,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:43,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:02:44,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:44,065 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-06 12:02:44,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:44,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-06 12:02:44,139 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-06 12:02:44,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368241343] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:44,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:44,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:02:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648813242] [2025-02-06 12:02:44,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:44,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:02:44,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:44,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:02:44,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:02:44,141 INFO L87 Difference]: Start difference. First operand 138 states and 152 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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-06 12:02:44,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:44,364 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2025-02-06 12:02:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:02:44,364 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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 9 [2025-02-06 12:02:44,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:44,365 INFO L225 Difference]: With dead ends: 142 [2025-02-06 12:02:44,365 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 12:02:44,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:02:44,366 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 280 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:44,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 570 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 12:02:44,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-02-06 12:02:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 87 states have (on average 1.7701149425287357) internal successors, (154), 139 states have internal predecessors, (154), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 156 transitions. [2025-02-06 12:02:44,382 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 156 transitions. Word has length 9 [2025-02-06 12:02:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:44,382 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 156 transitions. [2025-02-06 12:02:44,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 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-06 12:02:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 156 transitions. [2025-02-06 12:02:44,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:02:44,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:44,382 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:44,391 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-06 12:02:44,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:44,583 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:44,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash 616864916, now seen corresponding path program 1 times [2025-02-06 12:02:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:44,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663337147] [2025-02-06 12:02:44,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:44,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:02:44,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:02:44,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:44,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:44,782 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-06 12:02:44,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663337147] [2025-02-06 12:02:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663337147] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784779498] [2025-02-06 12:02:44,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:44,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:44,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:44,787 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-06 12:02:44,789 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-06 12:02:44,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:02:44,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:02:44,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:44,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:44,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:02:44,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:45,044 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-06 12:02:45,045 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:45,096 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-06 12:02:45,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784779498] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:45,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:45,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-06 12:02:45,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917081196] [2025-02-06 12:02:45,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:45,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 12:02:45,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:45,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 12:02:45,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:02:45,099 INFO L87 Difference]: Start difference. First operand 142 states and 156 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:45,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:45,134 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2025-02-06 12:02:45,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:02:45,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-02-06 12:02:45,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:45,136 INFO L225 Difference]: With dead ends: 157 [2025-02-06 12:02:45,136 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 12:02:45,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:02:45,139 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 4 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:45,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 575 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 12:02:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-06 12:02:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 154 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-02-06 12:02:45,149 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 21 [2025-02-06 12:02:45,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:45,149 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-02-06 12:02:45,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:45,149 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-02-06 12:02:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:02:45,150 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:45,150 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:45,159 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-06 12:02:45,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:45,351 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:45,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:45,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1200868367, now seen corresponding path program 2 times [2025-02-06 12:02:45,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:45,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139265529] [2025-02-06 12:02:45,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:45,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:45,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 12:02:45,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 36 statements. [2025-02-06 12:02:45,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:02:45,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:45,585 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-06 12:02:45,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:45,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139265529] [2025-02-06 12:02:45,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139265529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:45,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:45,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:45,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149420846] [2025-02-06 12:02:45,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:45,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:45,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:45,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:45,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:45,587 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:45,666 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2025-02-06 12:02:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:45,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-02-06 12:02:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:45,668 INFO L225 Difference]: With dead ends: 152 [2025-02-06 12:02:45,668 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 12:02:45,668 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-06 12:02:45,668 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 124 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:45,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 99 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 12:02:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-02-06 12:02:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 102 states have (on average 1.607843137254902) internal successors, (164), 149 states have internal predecessors, (164), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2025-02-06 12:02:45,680 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 36 [2025-02-06 12:02:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:45,680 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2025-02-06 12:02:45,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2025-02-06 12:02:45,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:02:45,681 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:45,681 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:45,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:02:45,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:45,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1200868366, now seen corresponding path program 1 times [2025-02-06 12:02:45,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:45,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341528057] [2025-02-06 12:02:45,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:45,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:45,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 12:02:45,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 12:02:45,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:45,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:46,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:46,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341528057] [2025-02-06 12:02:46,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341528057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:46,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987852192] [2025-02-06 12:02:46,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:46,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:46,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:46,005 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-06 12:02:46,011 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-06 12:02:46,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 12:02:46,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 12:02:46,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:46,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:46,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:02:46,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:46,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:46,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987852192] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:46,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:46,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-02-06 12:02:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26200116] [2025-02-06 12:02:46,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:46,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:02:46,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:46,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:02:46,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:46,364 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:46,404 INFO L93 Difference]: Finished difference Result 158 states and 172 transitions. [2025-02-06 12:02:46,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-02-06 12:02:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:46,405 INFO L225 Difference]: With dead ends: 158 [2025-02-06 12:02:46,405 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 12:02:46,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:46,406 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 2 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:46,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 555 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 12:02:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-06 12:02:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 108 states have (on average 1.5740740740740742) internal successors, (170), 155 states have internal predecessors, (170), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 172 transitions. [2025-02-06 12:02:46,414 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 172 transitions. Word has length 36 [2025-02-06 12:02:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:46,414 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 172 transitions. [2025-02-06 12:02:46,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 172 transitions. [2025-02-06 12:02:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 12:02:46,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:46,415 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:46,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:46,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:46,616 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:46,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:46,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1484158702, now seen corresponding path program 2 times [2025-02-06 12:02:46,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:46,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133499126] [2025-02-06 12:02:46,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:46,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:46,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 12:02:46,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-02-06 12:02:46,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:02:46,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:47,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133499126] [2025-02-06 12:02:47,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133499126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:47,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:47,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730738790] [2025-02-06 12:02:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:47,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:47,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:47,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:47,026 INFO L87 Difference]: Start difference. First operand 158 states and 172 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:47,203 INFO L93 Difference]: Finished difference Result 248 states and 274 transitions. [2025-02-06 12:02:47,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:02:47,203 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-02-06 12:02:47,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:47,204 INFO L225 Difference]: With dead ends: 248 [2025-02-06 12:02:47,204 INFO L226 Difference]: Without dead ends: 248 [2025-02-06 12:02:47,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:47,205 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 360 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:47,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 388 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:47,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-06 12:02:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 157. [2025-02-06 12:02:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 154 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-02-06 12:02:47,214 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 42 [2025-02-06 12:02:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:47,214 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-02-06 12:02:47,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-02-06 12:02:47,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 12:02:47,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:47,215 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:47,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:02:47,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:47,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2116543142, now seen corresponding path program 1 times [2025-02-06 12:02:47,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:47,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081330014] [2025-02-06 12:02:47,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:47,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:47,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 12:02:47,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 12:02:47,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:47,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:47,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:47,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081330014] [2025-02-06 12:02:47,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081330014] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:47,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:47,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:02:47,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038255561] [2025-02-06 12:02:47,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:47,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:02:47,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:47,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:02:47,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:47,603 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:47,788 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2025-02-06 12:02:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:47,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-02-06 12:02:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:47,789 INFO L225 Difference]: With dead ends: 176 [2025-02-06 12:02:47,789 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 12:02:47,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:47,790 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 161 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:47,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 205 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 12:02:47,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2025-02-06 12:02:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 122 states have (on average 1.5655737704918034) internal successors, (191), 168 states have internal predecessors, (191), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 193 transitions. [2025-02-06 12:02:47,793 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 193 transitions. Word has length 45 [2025-02-06 12:02:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:47,793 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 193 transitions. [2025-02-06 12:02:47,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 193 transitions. [2025-02-06 12:02:47,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 12:02:47,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:47,794 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:47,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:02:47,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:47,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:47,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2116542213, now seen corresponding path program 1 times [2025-02-06 12:02:47,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:47,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631684178] [2025-02-06 12:02:47,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:47,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:47,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 12:02:47,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 12:02:47,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:47,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:47,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631684178] [2025-02-06 12:02:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631684178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:47,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:47,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:47,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697753369] [2025-02-06 12:02:47,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:47,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:02:47,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:47,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:02:47,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:02:47,948 INFO L87 Difference]: Start difference. First operand 171 states and 193 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:48,032 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2025-02-06 12:02:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:02:48,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-02-06 12:02:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:48,034 INFO L225 Difference]: With dead ends: 165 [2025-02-06 12:02:48,034 INFO L226 Difference]: Without dead ends: 165 [2025-02-06 12:02:48,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-06 12:02:48,034 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 188 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:48,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 122 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:48,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-02-06 12:02:48,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-02-06 12:02:48,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.5163934426229508) internal successors, (185), 162 states have internal predecessors, (185), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2025-02-06 12:02:48,037 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 45 [2025-02-06 12:02:48,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:48,037 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2025-02-06 12:02:48,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2025-02-06 12:02:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 12:02:48,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:48,038 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:48,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:02:48,038 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:48,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash 2116542214, now seen corresponding path program 1 times [2025-02-06 12:02:48,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:48,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259285549] [2025-02-06 12:02:48,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:48,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:48,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 12:02:48,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 12:02:48,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:48,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:48,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:48,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259285549] [2025-02-06 12:02:48,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259285549] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:48,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:48,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505447279] [2025-02-06 12:02:48,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:48,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:02:48,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:48,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:02:48,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:48,234 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:48,279 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2025-02-06 12:02:48,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:48,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-02-06 12:02:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:48,281 INFO L225 Difference]: With dead ends: 170 [2025-02-06 12:02:48,281 INFO L226 Difference]: Without dead ends: 170 [2025-02-06 12:02:48,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:48,282 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 142 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:48,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 493 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:48,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-06 12:02:48,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 165. [2025-02-06 12:02:48,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 122 states have (on average 1.5081967213114753) internal successors, (184), 162 states have internal predecessors, (184), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2025-02-06 12:02:48,285 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 45 [2025-02-06 12:02:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:48,285 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2025-02-06 12:02:48,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,285 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2025-02-06 12:02:48,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 12:02:48,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:48,285 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:48,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:02:48,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:48,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:48,286 INFO L85 PathProgramCache]: Analyzing trace with hash -478012180, now seen corresponding path program 1 times [2025-02-06 12:02:48,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:48,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502198403] [2025-02-06 12:02:48,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:48,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 12:02:48,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 12:02:48,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:48,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:48,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:48,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502198403] [2025-02-06 12:02:48,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502198403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:48,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:48,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:48,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499094044] [2025-02-06 12:02:48,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:48,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:48,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:48,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:48,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:48,489 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:48,544 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2025-02-06 12:02:48,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:48,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-06 12:02:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:48,546 INFO L225 Difference]: With dead ends: 164 [2025-02-06 12:02:48,546 INFO L226 Difference]: Without dead ends: 164 [2025-02-06 12:02:48,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:48,546 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 115 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:48,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:48,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-06 12:02:48,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2025-02-06 12:02:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 122 states have (on average 1.4918032786885247) internal successors, (182), 161 states have internal predecessors, (182), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2025-02-06 12:02:48,549 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 48 [2025-02-06 12:02:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2025-02-06 12:02:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2025-02-06 12:02:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 12:02:48,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:48,550 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:48,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:02:48,550 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:48,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:48,551 INFO L85 PathProgramCache]: Analyzing trace with hash -478012179, now seen corresponding path program 1 times [2025-02-06 12:02:48,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:48,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220087453] [2025-02-06 12:02:48,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:48,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:48,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 12:02:48,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 12:02:48,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:49,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:49,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220087453] [2025-02-06 12:02:49,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220087453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:49,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:49,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:02:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050186380] [2025-02-06 12:02:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:49,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:02:49,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:49,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:02:49,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:02:49,046 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:49,277 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2025-02-06 12:02:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:02:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-06 12:02:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:49,278 INFO L225 Difference]: With dead ends: 168 [2025-02-06 12:02:49,279 INFO L226 Difference]: Without dead ends: 168 [2025-02-06 12:02:49,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:02:49,279 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 178 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:49,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 253 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:49,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-06 12:02:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2025-02-06 12:02:49,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 122 states have (on average 1.4836065573770492) internal successors, (181), 161 states have internal predecessors, (181), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 183 transitions. [2025-02-06 12:02:49,282 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 183 transitions. Word has length 48 [2025-02-06 12:02:49,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:49,282 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 183 transitions. [2025-02-06 12:02:49,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 183 transitions. [2025-02-06 12:02:49,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 12:02:49,283 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:49,283 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:49,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:02:49,283 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:49,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1650839070, now seen corresponding path program 1 times [2025-02-06 12:02:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:49,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021228380] [2025-02-06 12:02:49,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:49,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:02:49,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:02:49,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:49,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:49,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:49,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021228380] [2025-02-06 12:02:49,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021228380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:49,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:49,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839713668] [2025-02-06 12:02:49,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:49,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:49,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:49,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:49,531 INFO L87 Difference]: Start difference. First operand 164 states and 183 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:49,646 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2025-02-06 12:02:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:49,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-02-06 12:02:49,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:49,647 INFO L225 Difference]: With dead ends: 163 [2025-02-06 12:02:49,647 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 12:02:49,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:49,647 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 12 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:49,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 360 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:49,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 12:02:49,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-06 12:02:49,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 122 states have (on average 1.4672131147540983) internal successors, (179), 160 states have internal predecessors, (179), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 181 transitions. [2025-02-06 12:02:49,650 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 181 transitions. Word has length 51 [2025-02-06 12:02:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:49,651 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 181 transitions. [2025-02-06 12:02:49,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2025-02-06 12:02:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 12:02:49,651 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:49,651 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:49,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:02:49,651 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:49,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:49,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1650839071, now seen corresponding path program 1 times [2025-02-06 12:02:49,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664349828] [2025-02-06 12:02:49,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:49,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:02:49,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:02:49,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:49,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:49,967 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:49,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:49,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664349828] [2025-02-06 12:02:49,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664349828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:49,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:49,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772092843] [2025-02-06 12:02:49,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:49,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:49,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:49,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:49,968 INFO L87 Difference]: Start difference. First operand 163 states and 181 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:50,100 INFO L93 Difference]: Finished difference Result 162 states and 179 transitions. [2025-02-06 12:02:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-02-06 12:02:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:50,101 INFO L225 Difference]: With dead ends: 162 [2025-02-06 12:02:50,102 INFO L226 Difference]: Without dead ends: 162 [2025-02-06 12:02:50,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:50,102 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 11 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:50,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 340 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-06 12:02:50,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-06 12:02:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 122 states have (on average 1.4508196721311475) internal successors, (177), 159 states have internal predecessors, (177), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 179 transitions. [2025-02-06 12:02:50,105 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 179 transitions. Word has length 51 [2025-02-06 12:02:50,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:50,105 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 179 transitions. [2025-02-06 12:02:50,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,106 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 179 transitions. [2025-02-06 12:02:50,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 12:02:50,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:50,106 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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-06 12:02:50,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:02:50,106 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:50,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:50,107 INFO L85 PathProgramCache]: Analyzing trace with hash 11820370, now seen corresponding path program 1 times [2025-02-06 12:02:50,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:50,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864935143] [2025-02-06 12:02:50,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:50,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:50,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 12:02:50,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 12:02:50,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:50,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:50,194 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:50,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:50,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864935143] [2025-02-06 12:02:50,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864935143] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:50,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:50,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:50,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474983324] [2025-02-06 12:02:50,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:50,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:50,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:50,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:50,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:50,196 INFO L87 Difference]: Start difference. First operand 162 states and 179 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:50,205 INFO L93 Difference]: Finished difference Result 174 states and 194 transitions. [2025-02-06 12:02:50,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:50,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-06 12:02:50,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:50,206 INFO L225 Difference]: With dead ends: 174 [2025-02-06 12:02:50,206 INFO L226 Difference]: Without dead ends: 174 [2025-02-06 12:02:50,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:50,207 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 257 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-06 12:02:50,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 257 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:50,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-06 12:02:50,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 164. [2025-02-06 12:02:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 124 states have (on average 1.4435483870967742) internal successors, (179), 161 states have internal predecessors, (179), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 181 transitions. [2025-02-06 12:02:50,210 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 181 transitions. Word has length 55 [2025-02-06 12:02:50,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:50,210 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 181 transitions. [2025-02-06 12:02:50,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,210 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2025-02-06 12:02:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 12:02:50,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:50,210 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:50,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:02:50,211 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:50,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:50,211 INFO L85 PathProgramCache]: Analyzing trace with hash 366677922, now seen corresponding path program 1 times [2025-02-06 12:02:50,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:50,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888173795] [2025-02-06 12:02:50,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:50,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 12:02:50,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 12:02:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:50,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:50,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888173795] [2025-02-06 12:02:50,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888173795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:50,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:50,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:50,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696241970] [2025-02-06 12:02:50,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:50,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:50,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:50,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:50,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:50,327 INFO L87 Difference]: Start difference. First operand 164 states and 181 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:50,423 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2025-02-06 12:02:50,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:50,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-02-06 12:02:50,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:50,424 INFO L225 Difference]: With dead ends: 163 [2025-02-06 12:02:50,424 INFO L226 Difference]: Without dead ends: 163 [2025-02-06 12:02:50,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:50,425 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 5 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:50,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 394 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:50,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-02-06 12:02:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2025-02-06 12:02:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 160 states have internal predecessors, (177), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2025-02-06 12:02:50,428 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 56 [2025-02-06 12:02:50,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:50,428 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2025-02-06 12:02:50,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2025-02-06 12:02:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 12:02:50,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:50,429 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:50,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:02:50,429 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:50,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash 366677923, now seen corresponding path program 1 times [2025-02-06 12:02:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:50,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50609828] [2025-02-06 12:02:50,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:50,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:50,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 12:02:50,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 12:02:50,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:50,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:50,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:50,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50609828] [2025-02-06 12:02:50,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50609828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:50,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:50,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:50,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948066892] [2025-02-06 12:02:50,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:50,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:50,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:50,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:50,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:50,820 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:51,000 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2025-02-06 12:02:51,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:02:51,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-02-06 12:02:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:51,002 INFO L225 Difference]: With dead ends: 171 [2025-02-06 12:02:51,002 INFO L226 Difference]: Without dead ends: 171 [2025-02-06 12:02:51,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:02:51,002 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 11 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:51,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 405 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-06 12:02:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2025-02-06 12:02:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.4153846153846155) internal successors, (184), 166 states have internal predecessors, (184), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 186 transitions. [2025-02-06 12:02:51,005 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 186 transitions. Word has length 56 [2025-02-06 12:02:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:51,006 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 186 transitions. [2025-02-06 12:02:51,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2025-02-06 12:02:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 12:02:51,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:51,006 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:51,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:02:51,007 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:51,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:51,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1931401857, now seen corresponding path program 1 times [2025-02-06 12:02:51,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:51,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594741813] [2025-02-06 12:02:51,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:51,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:51,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 12:02:51,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 12:02:51,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:51,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:51,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594741813] [2025-02-06 12:02:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594741813] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535140772] [2025-02-06 12:02:51,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:51,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:51,111 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-06 12:02:51,115 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-06 12:02:51,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 12:02:51,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 12:02:51,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:51,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:51,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 1341 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:02:51,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:51,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:51,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535140772] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:51,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:51,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:02:51,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786903036] [2025-02-06 12:02:51,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:51,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:51,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:51,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:51,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:51,397 INFO L87 Difference]: Start difference. First operand 169 states and 186 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:51,420 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2025-02-06 12:02:51,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:51,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2025-02-06 12:02:51,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:51,421 INFO L225 Difference]: With dead ends: 196 [2025-02-06 12:02:51,421 INFO L226 Difference]: Without dead ends: 196 [2025-02-06 12:02:51,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:51,422 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 13 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:51,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 510 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-06 12:02:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2025-02-06 12:02:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 190 states have internal predecessors, (214), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 216 transitions. [2025-02-06 12:02:51,425 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 216 transitions. Word has length 60 [2025-02-06 12:02:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:51,426 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 216 transitions. [2025-02-06 12:02:51,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 216 transitions. [2025-02-06 12:02:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 12:02:51,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:51,426 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:51,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:51,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:51,631 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:51,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash 256331030, now seen corresponding path program 1 times [2025-02-06 12:02:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:51,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871807291] [2025-02-06 12:02:51,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:51,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 12:02:51,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 12:02:51,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:51,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:52,142 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:52,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871807291] [2025-02-06 12:02:52,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871807291] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:52,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214370532] [2025-02-06 12:02:52,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:52,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:52,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:52,144 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-06 12:02:52,146 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-06 12:02:52,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 12:02:52,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 12:02:52,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:52,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:52,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 12:02:52,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:52,430 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-06 12:02:52,449 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 23 treesize of output 1 [2025-02-06 12:02:52,451 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 23 treesize of output 1 [2025-02-06 12:02:52,587 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 25 treesize of output 9 [2025-02-06 12:02:52,593 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 36 treesize of output 12 [2025-02-06 12:02:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:52,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:52,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214370532] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:52,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:52,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-02-06 12:02:52,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591138889] [2025-02-06 12:02:52,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:52,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:02:52,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:52,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:02:52,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-02-06 12:02:52,810 INFO L87 Difference]: Start difference. First operand 193 states and 216 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:53,210 INFO L93 Difference]: Finished difference Result 192 states and 210 transitions. [2025-02-06 12:02:53,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:53,211 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2025-02-06 12:02:53,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:53,212 INFO L225 Difference]: With dead ends: 192 [2025-02-06 12:02:53,212 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 12:02:53,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:02:53,213 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 26 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:53,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 693 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:02:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 12:02:53,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-02-06 12:02:53,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 154 states have (on average 1.3506493506493507) internal successors, (208), 189 states have internal predecessors, (208), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2025-02-06 12:02:53,217 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 61 [2025-02-06 12:02:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:53,218 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2025-02-06 12:02:53,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2025-02-06 12:02:53,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 12:02:53,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:53,218 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 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-06 12:02:53,231 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-06 12:02:53,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:53,419 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:53,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash 563076498, now seen corresponding path program 2 times [2025-02-06 12:02:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:53,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244719641] [2025-02-06 12:02:53,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:53,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:53,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-06 12:02:53,486 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 12:02:53,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:02:53,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244719641] [2025-02-06 12:02:53,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244719641] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814441330] [2025-02-06 12:02:53,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:53,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:53,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:53,638 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-06 12:02:53,639 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-06 12:02:53,791 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-06 12:02:53,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 12:02:53,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:02:53,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:53,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:02:53,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:53,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:54,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814441330] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:54,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:54,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 12:02:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713466700] [2025-02-06 12:02:54,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:54,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:02:54,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:54,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:02:54,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:54,037 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:54,079 INFO L93 Difference]: Finished difference Result 261 states and 276 transitions. [2025-02-06 12:02:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:54,079 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2025-02-06 12:02:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:54,080 INFO L225 Difference]: With dead ends: 261 [2025-02-06 12:02:54,080 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 12:02:54,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:54,080 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 24 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:54,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 774 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:54,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 12:02:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 252. [2025-02-06 12:02:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 214 states have (on average 1.280373831775701) internal successors, (274), 249 states have internal predecessors, (274), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 276 transitions. [2025-02-06 12:02:54,086 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 276 transitions. Word has length 75 [2025-02-06 12:02:54,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:54,086 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 276 transitions. [2025-02-06 12:02:54,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 276 transitions. [2025-02-06 12:02:54,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 12:02:54,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:54,087 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 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-06 12:02:54,096 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-06 12:02:54,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-06 12:02:54,288 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:54,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:54,288 INFO L85 PathProgramCache]: Analyzing trace with hash -36621838, now seen corresponding path program 3 times [2025-02-06 12:02:54,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:54,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176847509] [2025-02-06 12:02:54,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:02:54,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:54,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-02-06 12:02:54,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-02-06 12:02:54,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 12:02:54,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:54,797 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:54,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:54,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176847509] [2025-02-06 12:02:54,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176847509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:54,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642681415] [2025-02-06 12:02:54,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:02:54,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:54,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:54,802 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-06 12:02:54,804 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-06 12:02:54,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-02-06 12:02:55,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-02-06 12:02:55,071 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 12:02:55,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:55,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:02:55,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:55,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:02:55,146 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 19 treesize of output 14 [2025-02-06 12:02:55,156 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:55,156 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-06 12:02:55,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:02:55,594 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 19 treesize of output 14 [2025-02-06 12:02:55,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:55,602 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-06 12:02:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:55,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:56,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:02:56,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2025-02-06 12:02:56,806 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 66 treesize of output 62 [2025-02-06 12:02:56,824 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-06 12:02:56,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2025-02-06 12:02:56,851 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:56,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642681415] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:56,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:56,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2025-02-06 12:02:56,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753373408] [2025-02-06 12:02:56,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:56,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 12:02:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:56,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 12:02:56,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:02:56,852 INFO L87 Difference]: Start difference. First operand 252 states and 276 transitions. Second operand has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:57,376 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2025-02-06 12:02:57,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 12:02:57,376 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-02-06 12:02:57,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:57,377 INFO L225 Difference]: With dead ends: 248 [2025-02-06 12:02:57,377 INFO L226 Difference]: Without dead ends: 248 [2025-02-06 12:02:57,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:02:57,379 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 358 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:57,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 736 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:02:57,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-02-06 12:02:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 193. [2025-02-06 12:02:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 159 states have (on average 1.2893081761006289) internal successors, (205), 190 states have internal predecessors, (205), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:57,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 207 transitions. [2025-02-06 12:02:57,383 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 207 transitions. Word has length 105 [2025-02-06 12:02:57,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:57,383 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 207 transitions. [2025-02-06 12:02:57,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:57,383 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 207 transitions. [2025-02-06 12:02:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 12:02:57,383 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:57,383 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:57,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:57,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:57,584 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:57,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash -36622766, now seen corresponding path program 1 times [2025-02-06 12:02:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:57,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82429445] [2025-02-06 12:02:57,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:57,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:57,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 12:02:57,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 12:02:57,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:57,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:58,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82429445] [2025-02-06 12:02:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82429445] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864293133] [2025-02-06 12:02:58,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:58,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:58,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:58,146 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-06 12:02:58,158 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-06 12:02:58,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 12:02:58,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 12:02:58,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:58,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:58,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 12:02:58,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:58,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:02:58,575 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 16 treesize of output 11 [2025-02-06 12:02:58,585 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:58,585 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-06 12:02:58,758 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:58,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:58,995 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 49 treesize of output 45 [2025-02-06 12:02:59,011 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-06 12:02:59,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-02-06 12:02:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:59,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864293133] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:59,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:59,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-02-06 12:02:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566895364] [2025-02-06 12:02:59,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:59,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:02:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:59,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:02:59,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:02:59,038 INFO L87 Difference]: Start difference. First operand 193 states and 207 transitions. Second operand has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:59,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:59,362 INFO L93 Difference]: Finished difference Result 253 states and 271 transitions. [2025-02-06 12:02:59,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:02:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2025-02-06 12:02:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:59,364 INFO L225 Difference]: With dead ends: 253 [2025-02-06 12:02:59,364 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 12:02:59,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2025-02-06 12:02:59,365 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 778 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:59,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 380 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 12:02:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 192. [2025-02-06 12:02:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 162 states have (on average 1.2592592592592593) internal successors, (204), 189 states have internal predecessors, (204), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:59,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 206 transitions. [2025-02-06 12:02:59,369 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 206 transitions. Word has length 105 [2025-02-06 12:02:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:59,369 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 206 transitions. [2025-02-06 12:02:59,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 206 transitions. [2025-02-06 12:02:59,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 12:02:59,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:59,371 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:59,385 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-06 12:02:59,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:59,577 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:02:59,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash -79365599, now seen corresponding path program 1 times [2025-02-06 12:02:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:59,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622686600] [2025-02-06 12:02:59,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:59,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:02:59,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:02:59,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:59,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622686600] [2025-02-06 12:03:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622686600] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:00,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354910355] [2025-02-06 12:03:00,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:00,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:00,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:00,541 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-06 12:03:00,542 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-06 12:03:00,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:03:00,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:03:00,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:00,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:00,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 12:03:00,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:00,956 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-06 12:03:00,956 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 1 case distinctions, treesize of input 21 treesize of output 23 [2025-02-06 12:03:00,971 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-06 12:03:00,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-06 12:03:01,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:01,103 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-02-06 12:03:01,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 40 [2025-02-06 12:03:01,114 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:03:01,114 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-06 12:03:01,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:01,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2025-02-06 12:03:01,775 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:03:01,776 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-06 12:03:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:01,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:02,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:03:02,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-06 12:03:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:02,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354910355] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:02,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:02,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-02-06 12:03:02,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088255652] [2025-02-06 12:03:02,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:02,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 12:03:02,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:02,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 12:03:02,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=389, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:03:02,914 INFO L87 Difference]: Start difference. First operand 192 states and 206 transitions. Second operand has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:03,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:03,484 INFO L93 Difference]: Finished difference Result 306 states and 323 transitions. [2025-02-06 12:03:03,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:03:03,484 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2025-02-06 12:03:03,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:03,485 INFO L225 Difference]: With dead ends: 306 [2025-02-06 12:03:03,485 INFO L226 Difference]: Without dead ends: 306 [2025-02-06 12:03:03,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 201 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:03:03,486 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 340 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:03,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 524 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:03:03,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-02-06 12:03:03,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 187. [2025-02-06 12:03:03,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 158 states have (on average 1.259493670886076) internal successors, (199), 184 states have internal predecessors, (199), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2025-02-06 12:03:03,490 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 108 [2025-02-06 12:03:03,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:03,490 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2025-02-06 12:03:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2025-02-06 12:03:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-06 12:03:03,491 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:03,491 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:03,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 12:03:03,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:03,695 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:03,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:03,695 INFO L85 PathProgramCache]: Analyzing trace with hash 211165377, now seen corresponding path program 1 times [2025-02-06 12:03:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:03,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603684214] [2025-02-06 12:03:03,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:03,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:03,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 12:03:03,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 12:03:03,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:03,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:03,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:03,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603684214] [2025-02-06 12:03:03,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603684214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:03,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:03,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:03:03,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156293458] [2025-02-06 12:03:03,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:03,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:03:03,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:03,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:03:03,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:03:03,941 INFO L87 Difference]: Start difference. First operand 187 states and 201 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:04,028 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2025-02-06 12:03:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:03:04,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 110 [2025-02-06 12:03:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:04,029 INFO L225 Difference]: With dead ends: 193 [2025-02-06 12:03:04,029 INFO L226 Difference]: Without dead ends: 193 [2025-02-06 12:03:04,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:04,030 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 5 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:04,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 442 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-06 12:03:04,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2025-02-06 12:03:04,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 161 states have (on average 1.2546583850931676) internal successors, (202), 187 states have internal predecessors, (202), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 204 transitions. [2025-02-06 12:03:04,035 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 204 transitions. Word has length 110 [2025-02-06 12:03:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:04,035 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 204 transitions. [2025-02-06 12:03:04,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 204 transitions. [2025-02-06 12:03:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 12:03:04,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:04,036 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:04,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 12:03:04,037 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:04,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:04,037 INFO L85 PathProgramCache]: Analyzing trace with hash -2015493704, now seen corresponding path program 1 times [2025-02-06 12:03:04,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:04,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714830995] [2025-02-06 12:03:04,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:04,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:04,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 12:03:04,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 12:03:04,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:04,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:05,572 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:05,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714830995] [2025-02-06 12:03:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714830995] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:05,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641251952] [2025-02-06 12:03:05,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:05,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:05,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:05,577 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-06 12:03:05,579 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-06 12:03:05,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 12:03:06,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 12:03:06,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:06,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:06,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 12:03:06,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:06,023 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 15 treesize of output 11 [2025-02-06 12:03:06,057 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 15 treesize of output 11 [2025-02-06 12:03:06,257 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-02-06 12:03:06,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 12:03:06,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:06,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 12:03:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:06,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:07,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641251952] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:07,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:07,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-02-06 12:03:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252396902] [2025-02-06 12:03:07,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:03:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:07,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:03:07,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-02-06 12:03:07,114 INFO L87 Difference]: Start difference. First operand 190 states and 204 transitions. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:07,402 INFO L93 Difference]: Finished difference Result 274 states and 291 transitions. [2025-02-06 12:03:07,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:03:07,405 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2025-02-06 12:03:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:07,407 INFO L225 Difference]: With dead ends: 274 [2025-02-06 12:03:07,407 INFO L226 Difference]: Without dead ends: 274 [2025-02-06 12:03:07,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2025-02-06 12:03:07,412 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 267 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:07,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1044 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:07,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-02-06 12:03:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 252. [2025-02-06 12:03:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 223 states have (on average 1.1928251121076232) internal successors, (266), 249 states have internal predecessors, (266), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 268 transitions. [2025-02-06 12:03:07,427 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 268 transitions. Word has length 112 [2025-02-06 12:03:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:07,432 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 268 transitions. [2025-02-06 12:03:07,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 268 transitions. [2025-02-06 12:03:07,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 12:03:07,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:07,432 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:07,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 12:03:07,633 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,SelfDestructingSolverStorable25 [2025-02-06 12:03:07,633 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:07,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:07,634 INFO L85 PathProgramCache]: Analyzing trace with hash 938932502, now seen corresponding path program 1 times [2025-02-06 12:03:07,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:07,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986730964] [2025-02-06 12:03:07,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:07,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:07,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 12:03:07,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 12:03:07,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:07,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:07,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:07,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986730964] [2025-02-06 12:03:07,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986730964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:07,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:07,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:03:07,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890228135] [2025-02-06 12:03:07,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:07,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:07,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:07,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:07,785 INFO L87 Difference]: Start difference. First operand 252 states and 268 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:07,794 INFO L93 Difference]: Finished difference Result 256 states and 273 transitions. [2025-02-06 12:03:07,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:07,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-02-06 12:03:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:07,795 INFO L225 Difference]: With dead ends: 256 [2025-02-06 12:03:07,795 INFO L226 Difference]: Without dead ends: 256 [2025-02-06 12:03:07,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:07,795 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 235 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-06 12:03:07,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 235 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-02-06 12:03:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2025-02-06 12:03:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 224 states have (on average 1.1919642857142858) internal successors, (267), 250 states have internal predecessors, (267), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 269 transitions. [2025-02-06 12:03:07,799 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 269 transitions. Word has length 115 [2025-02-06 12:03:07,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:07,799 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 269 transitions. [2025-02-06 12:03:07,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2025-02-06 12:03:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 12:03:07,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:07,800 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:07,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 12:03:07,800 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:07,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash 938932662, now seen corresponding path program 1 times [2025-02-06 12:03:07,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:07,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187695650] [2025-02-06 12:03:07,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:07,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:07,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 12:03:07,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 12:03:07,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:07,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:07,926 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:07,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:07,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187695650] [2025-02-06 12:03:07,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187695650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:07,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:07,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:03:07,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066682784] [2025-02-06 12:03:07,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:07,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:07,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:07,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:07,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:07,928 INFO L87 Difference]: Start difference. First operand 253 states and 269 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:07,934 INFO L93 Difference]: Finished difference Result 254 states and 270 transitions. [2025-02-06 12:03:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:07,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 115 [2025-02-06 12:03:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:07,935 INFO L225 Difference]: With dead ends: 254 [2025-02-06 12:03:07,935 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 12:03:07,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:07,935 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:07,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 238 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 12:03:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-02-06 12:03:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 225 states have (on average 1.191111111111111) internal successors, (268), 251 states have internal predecessors, (268), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 270 transitions. [2025-02-06 12:03:07,939 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 270 transitions. Word has length 115 [2025-02-06 12:03:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:07,939 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 270 transitions. [2025-02-06 12:03:07,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:07,940 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 270 transitions. [2025-02-06 12:03:07,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 12:03:07,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:07,940 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:07,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 12:03:07,940 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:07,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:07,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1758460808, now seen corresponding path program 1 times [2025-02-06 12:03:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132803268] [2025-02-06 12:03:07,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:08,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 12:03:08,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 12:03:08,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:08,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:08,795 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 75 proven. 3 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-02-06 12:03:08,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:08,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132803268] [2025-02-06 12:03:08,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132803268] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:08,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164331950] [2025-02-06 12:03:08,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:08,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:08,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:08,798 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-06 12:03:08,800 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-06 12:03:09,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 12:03:09,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 12:03:09,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:09,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:09,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 12:03:09,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:09,186 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:03:09,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:09,293 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-02-06 12:03:09,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:09,308 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:09,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 12:03:09,333 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:09,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 12:03:09,353 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 23 treesize of output 1 [2025-02-06 12:03:09,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2025-02-06 12:03:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 20 proven. 18 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-06 12:03:10,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 19 proven. 19 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-06 12:03:10,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164331950] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:10,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:10,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 10] total 25 [2025-02-06 12:03:10,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718151203] [2025-02-06 12:03:10,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:10,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 12:03:10,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:10,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 12:03:10,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-02-06 12:03:10,645 INFO L87 Difference]: Start difference. First operand 254 states and 270 transitions. Second operand has 26 states, 25 states have (on average 4.96) internal successors, (124), 26 states have internal predecessors, (124), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 12:03:10,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:10,725 INFO L93 Difference]: Finished difference Result 252 states and 268 transitions. [2025-02-06 12:03:10,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:03:10,725 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 4.96) internal successors, (124), 26 states have internal predecessors, (124), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 116 [2025-02-06 12:03:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:10,726 INFO L225 Difference]: With dead ends: 252 [2025-02-06 12:03:10,726 INFO L226 Difference]: Without dead ends: 252 [2025-02-06 12:03:10,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2025-02-06 12:03:10,727 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 381 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:10,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 78 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-06 12:03:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-02-06 12:03:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 225 states have (on average 1.1822222222222223) internal successors, (266), 249 states have internal predecessors, (266), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:10,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 268 transitions. [2025-02-06 12:03:10,736 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 268 transitions. Word has length 116 [2025-02-06 12:03:10,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:10,738 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 268 transitions. [2025-02-06 12:03:10,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 4.96) internal successors, (124), 26 states have internal predecessors, (124), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-06 12:03:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 268 transitions. [2025-02-06 12:03:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 12:03:10,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:10,739 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:10,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 12:03:10,940 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,SelfDestructingSolverStorable28 [2025-02-06 12:03:10,940 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:10,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1758460807, now seen corresponding path program 1 times [2025-02-06 12:03:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082001731] [2025-02-06 12:03:10,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:10,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 12:03:11,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 12:03:11,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:11,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:12,136 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:12,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082001731] [2025-02-06 12:03:12,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082001731] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:12,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95827501] [2025-02-06 12:03:12,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:12,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:12,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:12,142 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-06 12:03:12,143 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-06 12:03:12,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 12:03:12,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 12:03:12,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:12,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:12,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 1668 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 12:03:12,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:12,626 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:03:12,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:12,630 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-06 12:03:12,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:12,895 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-06 12:03:12,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-06 12:03:12,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-02-06 12:03:12,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:12,915 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-06 12:03:12,970 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:12,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 12:03:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:13,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:14,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95827501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:14,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:03:14,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2025-02-06 12:03:14,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161648409] [2025-02-06 12:03:14,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:14,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 12:03:14,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:14,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 12:03:14,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:03:14,207 INFO L87 Difference]: Start difference. First operand 252 states and 268 transitions. Second operand has 21 states, 20 states have (on average 4.2) internal successors, (84), 20 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:14,587 INFO L93 Difference]: Finished difference Result 312 states and 329 transitions. [2025-02-06 12:03:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:03:14,587 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 20 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 116 [2025-02-06 12:03:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:14,588 INFO L225 Difference]: With dead ends: 312 [2025-02-06 12:03:14,588 INFO L226 Difference]: Without dead ends: 312 [2025-02-06 12:03:14,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 12:03:14,590 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1187 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:14,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 330 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:03:14,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-06 12:03:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 252. [2025-02-06 12:03:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 226 states have (on average 1.176991150442478) internal successors, (266), 249 states have internal predecessors, (266), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 268 transitions. [2025-02-06 12:03:14,595 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 268 transitions. Word has length 116 [2025-02-06 12:03:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:14,595 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 268 transitions. [2025-02-06 12:03:14,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.2) internal successors, (84), 20 states have internal predecessors, (84), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 268 transitions. [2025-02-06 12:03:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 12:03:14,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:14,596 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:14,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 12:03:14,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:14,801 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:14,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:14,802 INFO L85 PathProgramCache]: Analyzing trace with hash -589800837, now seen corresponding path program 1 times [2025-02-06 12:03:14,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143329358] [2025-02-06 12:03:14,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:14,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:14,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 12:03:14,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 12:03:14,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:14,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:16,484 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:16,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:16,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143329358] [2025-02-06 12:03:16,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143329358] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:16,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818700635] [2025-02-06 12:03:16,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:16,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:16,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:16,487 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-06 12:03:16,491 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-06 12:03:16,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 12:03:16,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 12:03:16,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:16,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:16,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 1689 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-06 12:03:16,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:16,978 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:03:16,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:16,986 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-06 12:03:17,226 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-02-06 12:03:17,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:17,247 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:17,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 12:03:17,258 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:03:17,259 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-06 12:03:17,362 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:17,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-06 12:03:17,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:03:18,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 60 treesize of output 44 [2025-02-06 12:03:19,012 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-02-06 12:03:19,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:20,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818700635] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:20,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:03:20,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 24 [2025-02-06 12:03:20,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698588326] [2025-02-06 12:03:20,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:20,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 12:03:20,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:20,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 12:03:20,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2025-02-06 12:03:20,231 INFO L87 Difference]: Start difference. First operand 252 states and 268 transitions. Second operand has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:21,257 INFO L93 Difference]: Finished difference Result 259 states and 275 transitions. [2025-02-06 12:03:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 12:03:21,257 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 119 [2025-02-06 12:03:21,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:21,258 INFO L225 Difference]: With dead ends: 259 [2025-02-06 12:03:21,258 INFO L226 Difference]: Without dead ends: 259 [2025-02-06 12:03:21,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 12:03:21,260 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 647 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:21,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 693 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:03:21,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-02-06 12:03:21,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 258. [2025-02-06 12:03:21,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 232 states have (on average 1.1724137931034482) internal successors, (272), 255 states have internal predecessors, (272), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 274 transitions. [2025-02-06 12:03:21,264 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 274 transitions. Word has length 119 [2025-02-06 12:03:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:21,265 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 274 transitions. [2025-02-06 12:03:21,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.0) internal successors, (96), 25 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:21,266 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 274 transitions. [2025-02-06 12:03:21,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-06 12:03:21,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:21,268 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:21,283 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-06 12:03:21,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:21,469 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:21,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash 648378811, now seen corresponding path program 2 times [2025-02-06 12:03:21,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:21,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276196175] [2025-02-06 12:03:21,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:21,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:21,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-02-06 12:03:21,615 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 12:03:21,616 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:03:21,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:22,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:22,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276196175] [2025-02-06 12:03:22,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276196175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:22,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711261963] [2025-02-06 12:03:22,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:22,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:22,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:22,975 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-06 12:03:22,976 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-06 12:03:23,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-02-06 12:03:23,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 12:03:23,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:03:23,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:23,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1731 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 12:03:23,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:23,510 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:03:23,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:23,515 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-06 12:03:23,784 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-02-06 12:03:23,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:23,806 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:23,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 12:03:23,826 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:03:23,826 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-06 12:03:23,960 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:23,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 17 [2025-02-06 12:03:24,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 12:03:24,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 9 treesize of output 5 [2025-02-06 12:03:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 143 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-06 12:03:25,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:26,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711261963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:26,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:03:26,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 30 [2025-02-06 12:03:26,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005936816] [2025-02-06 12:03:26,005 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:26,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 12:03:26,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:26,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 12:03:26,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1512, Unknown=0, NotChecked=0, Total=1806 [2025-02-06 12:03:26,006 INFO L87 Difference]: Start difference. First operand 258 states and 274 transitions. Second operand has 31 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:27,096 INFO L93 Difference]: Finished difference Result 330 states and 347 transitions. [2025-02-06 12:03:27,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 12:03:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 125 [2025-02-06 12:03:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:27,098 INFO L225 Difference]: With dead ends: 330 [2025-02-06 12:03:27,098 INFO L226 Difference]: Without dead ends: 330 [2025-02-06 12:03:27,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=708, Invalid=2598, Unknown=0, NotChecked=0, Total=3306 [2025-02-06 12:03:27,099 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 1548 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:27,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 697 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:03:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-06 12:03:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 270. [2025-02-06 12:03:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 244 states have (on average 1.1639344262295082) internal successors, (284), 267 states have internal predecessors, (284), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 286 transitions. [2025-02-06 12:03:27,111 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 286 transitions. Word has length 125 [2025-02-06 12:03:27,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:27,111 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 286 transitions. [2025-02-06 12:03:27,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6) internal successors, (108), 30 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 286 transitions. [2025-02-06 12:03:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-06 12:03:27,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:27,113 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:27,124 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-06 12:03:27,317 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,SelfDestructingSolverStorable31 [2025-02-06 12:03:27,318 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:27,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1169790917, now seen corresponding path program 3 times [2025-02-06 12:03:27,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:27,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909813157] [2025-02-06 12:03:27,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:03:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:27,351 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 137 statements into 12 equivalence classes. [2025-02-06 12:03:27,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 137 statements. [2025-02-06 12:03:27,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 12:03:27,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-02-06 12:03:27,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:27,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909813157] [2025-02-06 12:03:27,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909813157] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:27,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476587134] [2025-02-06 12:03:27,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:03:27,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:27,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:27,922 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-06 12:03:27,924 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-06 12:03:28,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 137 statements into 12 equivalence classes. [2025-02-06 12:03:28,327 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 137 statements. [2025-02-06 12:03:28,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 12:03:28,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:28,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 1210 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 12:03:28,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:28,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:28,366 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-06 12:03:28,387 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:03:28,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:28,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:28,743 INFO L349 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2025-02-06 12:03:28,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 28 [2025-02-06 12:03:28,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-02-06 12:03:28,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:28,871 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-06 12:03:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-02-06 12:03:29,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476587134] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:30,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:03:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 25 [2025-02-06 12:03:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512750287] [2025-02-06 12:03:30,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:30,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 12:03:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:30,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 12:03:30,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 12:03:30,412 INFO L87 Difference]: Start difference. First operand 270 states and 286 transitions. Second operand has 26 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 23 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:31,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:31,050 INFO L93 Difference]: Finished difference Result 328 states and 345 transitions. [2025-02-06 12:03:31,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 12:03:31,050 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 23 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 137 [2025-02-06 12:03:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:31,052 INFO L225 Difference]: With dead ends: 328 [2025-02-06 12:03:31,052 INFO L226 Difference]: Without dead ends: 328 [2025-02-06 12:03:31,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 12:03:31,053 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 718 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:31,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 599 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:03:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-06 12:03:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 268. [2025-02-06 12:03:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 243 states have (on average 1.1604938271604939) internal successors, (282), 265 states have internal predecessors, (282), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 284 transitions. [2025-02-06 12:03:31,061 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 284 transitions. Word has length 137 [2025-02-06 12:03:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:31,062 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 284 transitions. [2025-02-06 12:03:31,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.9166666666666665) internal successors, (94), 23 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:31,062 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 284 transitions. [2025-02-06 12:03:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-02-06 12:03:31,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:31,064 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:31,076 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-06 12:03:31,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:31,265 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:31,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash -616790346, now seen corresponding path program 1 times [2025-02-06 12:03:31,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:31,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503906751] [2025-02-06 12:03:31,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:31,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 12:03:31,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 12:03:31,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:31,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:31,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503906751] [2025-02-06 12:03:31,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503906751] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:31,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872321413] [2025-02-06 12:03:31,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:31,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:31,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:31,571 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:31,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 12:03:31,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-02-06 12:03:32,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-02-06 12:03:32,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:32,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:32,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1838 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 12:03:32,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:32,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:32,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872321413] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:32,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:32,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-02-06 12:03:32,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815880986] [2025-02-06 12:03:32,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:32,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:03:32,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:32,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:03:32,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:03:32,161 INFO L87 Difference]: Start difference. First operand 268 states and 284 transitions. Second operand has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:32,210 INFO L93 Difference]: Finished difference Result 295 states and 311 transitions. [2025-02-06 12:03:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 12:03:32,210 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 141 [2025-02-06 12:03:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:32,211 INFO L225 Difference]: With dead ends: 295 [2025-02-06 12:03:32,211 INFO L226 Difference]: Without dead ends: 295 [2025-02-06 12:03:32,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:03:32,212 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:32,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 342 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:32,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-06 12:03:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2025-02-06 12:03:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 270 states have (on average 1.1444444444444444) internal successors, (309), 292 states have internal predecessors, (309), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 311 transitions. [2025-02-06 12:03:32,216 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 311 transitions. Word has length 141 [2025-02-06 12:03:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:32,216 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 311 transitions. [2025-02-06 12:03:32,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.947368421052632) internal successors, (94), 19 states have internal predecessors, (94), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 311 transitions. [2025-02-06 12:03:32,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-06 12:03:32,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:32,218 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:32,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 12:03:32,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:32,419 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:32,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:32,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2102633996, now seen corresponding path program 2 times [2025-02-06 12:03:32,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:32,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135708595] [2025-02-06 12:03:32,420 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:32,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:32,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-02-06 12:03:32,511 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 12:03:32,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:03:32,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:33,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:33,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135708595] [2025-02-06 12:03:33,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135708595] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:33,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336812025] [2025-02-06 12:03:33,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:33,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:33,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:33,032 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:33,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 12:03:33,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 168 statements into 2 equivalence classes. [2025-02-06 12:03:33,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 168 of 168 statements. [2025-02-06 12:03:33,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:03:33,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:33,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 2027 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 12:03:33,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:33,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:33,985 INFO L134 CoverageAnalysis]: Checked inductivity of 757 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336812025] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:33,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2025-02-06 12:03:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038754051] [2025-02-06 12:03:33,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:33,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 12:03:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:33,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 12:03:33,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 12:03:33,988 INFO L87 Difference]: Start difference. First operand 295 states and 311 transitions. Second operand has 37 states, 37 states have (on average 4.0) internal successors, (148), 37 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:34,107 INFO L93 Difference]: Finished difference Result 349 states and 365 transitions. [2025-02-06 12:03:34,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-06 12:03:34,108 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.0) internal successors, (148), 37 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 168 [2025-02-06 12:03:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:34,109 INFO L225 Difference]: With dead ends: 349 [2025-02-06 12:03:34,109 INFO L226 Difference]: Without dead ends: 349 [2025-02-06 12:03:34,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 12:03:34,110 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:34,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 681 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-02-06 12:03:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-02-06 12:03:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 324 states have (on average 1.1203703703703705) internal successors, (363), 346 states have internal predecessors, (363), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 365 transitions. [2025-02-06 12:03:34,115 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 365 transitions. Word has length 168 [2025-02-06 12:03:34,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:34,115 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 365 transitions. [2025-02-06 12:03:34,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.0) internal successors, (148), 37 states have internal predecessors, (148), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:34,116 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 365 transitions. [2025-02-06 12:03:34,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-06 12:03:34,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:34,117 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:34,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-06 12:03:34,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:34,318 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:34,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:34,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1524810004, now seen corresponding path program 2 times [2025-02-06 12:03:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177133525] [2025-02-06 12:03:34,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:34,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:34,356 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 172 statements into 2 equivalence classes. [2025-02-06 12:03:34,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 12:03:34,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:03:34,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 19 proven. 550 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 12:03:35,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:35,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177133525] [2025-02-06 12:03:35,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177133525] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:35,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159644976] [2025-02-06 12:03:35,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:35,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:35,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:35,597 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:35,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 12:03:35,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 172 statements into 2 equivalence classes. [2025-02-06 12:03:36,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 172 of 172 statements. [2025-02-06 12:03:36,186 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:03:36,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:36,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 12:03:36,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:36,316 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-06 12:03:36,332 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 15 treesize of output 1 [2025-02-06 12:03:36,478 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 17 treesize of output 9 [2025-02-06 12:03:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-06 12:03:36,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:36,567 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 18 treesize of output 16 [2025-02-06 12:03:36,568 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 20 [2025-02-06 12:03:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-06 12:03:36,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159644976] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:36,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:36,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2025-02-06 12:03:36,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19890220] [2025-02-06 12:03:36,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:36,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 12:03:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:36,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 12:03:36,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-02-06 12:03:36,657 INFO L87 Difference]: Start difference. First operand 349 states and 365 transitions. Second operand has 16 states, 15 states have (on average 7.533333333333333) internal successors, (113), 16 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:36,951 INFO L93 Difference]: Finished difference Result 599 states and 631 transitions. [2025-02-06 12:03:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:03:36,952 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 7.533333333333333) internal successors, (113), 16 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 172 [2025-02-06 12:03:36,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:36,953 INFO L225 Difference]: With dead ends: 599 [2025-02-06 12:03:36,953 INFO L226 Difference]: Without dead ends: 599 [2025-02-06 12:03:36,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-02-06 12:03:36,954 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 429 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:36,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 770 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:03:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-06 12:03:36,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 417. [2025-02-06 12:03:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 392 states have (on average 1.1096938775510203) internal successors, (435), 414 states have internal predecessors, (435), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 437 transitions. [2025-02-06 12:03:36,963 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 437 transitions. Word has length 172 [2025-02-06 12:03:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:36,963 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 437 transitions. [2025-02-06 12:03:36,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 7.533333333333333) internal successors, (113), 16 states have internal predecessors, (113), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 437 transitions. [2025-02-06 12:03:36,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 12:03:36,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:36,965 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:36,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-06 12:03:37,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-06 12:03:37,167 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:37,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash -24510452, now seen corresponding path program 1 times [2025-02-06 12:03:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:37,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035945002] [2025-02-06 12:03:37,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:37,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 12:03:37,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 12:03:37,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:37,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2025-02-06 12:03:37,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:37,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035945002] [2025-02-06 12:03:37,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035945002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:37,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:37,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:03:37,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029492384] [2025-02-06 12:03:37,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:37,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:37,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:37,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:37,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:37,457 INFO L87 Difference]: Start difference. First operand 417 states and 437 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:37,467 INFO L93 Difference]: Finished difference Result 380 states and 392 transitions. [2025-02-06 12:03:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:37,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2025-02-06 12:03:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:37,471 INFO L225 Difference]: With dead ends: 380 [2025-02-06 12:03:37,471 INFO L226 Difference]: Without dead ends: 380 [2025-02-06 12:03:37,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:37,472 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:37,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:37,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-06 12:03:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-02-06 12:03:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 371 states have (on average 1.0512129380053907) internal successors, (390), 377 states have internal predecessors, (390), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:37,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 392 transitions. [2025-02-06 12:03:37,478 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 392 transitions. Word has length 173 [2025-02-06 12:03:37,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:37,478 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 392 transitions. [2025-02-06 12:03:37,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:37,478 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 392 transitions. [2025-02-06 12:03:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-06 12:03:37,479 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:37,481 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:37,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 12:03:37,481 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:37,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:37,482 INFO L85 PathProgramCache]: Analyzing trace with hash -24469769, now seen corresponding path program 1 times [2025-02-06 12:03:37,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:37,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841029575] [2025-02-06 12:03:37,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:37,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:37,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 12:03:37,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 12:03:37,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:37,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-06 12:03:39,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841029575] [2025-02-06 12:03:39,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841029575] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134392485] [2025-02-06 12:03:39,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:39,143 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:39,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 12:03:39,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-06 12:03:39,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-06 12:03:39,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:39,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:39,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 2009 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-06 12:03:39,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:39,762 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-06 12:03:39,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 12:03:39,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-06 12:03:39,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-02-06 12:03:40,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-06 12:03:40,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:40,235 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 33 treesize of output 31 [2025-02-06 12:03:40,237 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 31 treesize of output 29 [2025-02-06 12:03:40,238 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 50 treesize of output 46 [2025-02-06 12:03:40,243 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 28 treesize of output 24 [2025-02-06 12:03:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-06 12:03:40,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134392485] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:40,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:40,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 20 [2025-02-06 12:03:40,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770666766] [2025-02-06 12:03:40,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:40,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 12:03:40,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:40,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 12:03:40,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2025-02-06 12:03:40,309 INFO L87 Difference]: Start difference. First operand 380 states and 392 transitions. Second operand has 21 states, 20 states have (on average 6.1) internal successors, (122), 21 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:40,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:40,607 INFO L93 Difference]: Finished difference Result 524 states and 542 transitions. [2025-02-06 12:03:40,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:03:40,607 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.1) internal successors, (122), 21 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 173 [2025-02-06 12:03:40,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:40,608 INFO L225 Difference]: With dead ends: 524 [2025-02-06 12:03:40,609 INFO L226 Difference]: Without dead ends: 524 [2025-02-06 12:03:40,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-02-06 12:03:40,609 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 129 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:40,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 732 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:03:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-02-06 12:03:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 381. [2025-02-06 12:03:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 372 states have (on average 1.0510752688172043) internal successors, (391), 378 states have internal predecessors, (391), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 393 transitions. [2025-02-06 12:03:40,614 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 393 transitions. Word has length 173 [2025-02-06 12:03:40,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:40,615 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 393 transitions. [2025-02-06 12:03:40,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.1) internal successors, (122), 21 states have internal predecessors, (122), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 393 transitions. [2025-02-06 12:03:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-06 12:03:40,616 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:40,616 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:40,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-06 12:03:40,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:40,817 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:40,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:40,818 INFO L85 PathProgramCache]: Analyzing trace with hash -758562742, now seen corresponding path program 1 times [2025-02-06 12:03:40,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:40,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456739479] [2025-02-06 12:03:40,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:40,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:40,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 12:03:40,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 12:03:40,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:40,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 485 proven. 149 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-02-06 12:03:41,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:41,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456739479] [2025-02-06 12:03:41,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456739479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:41,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540011865] [2025-02-06 12:03:41,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:41,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:41,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:41,890 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:41,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 12:03:42,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-06 12:03:42,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-06 12:03:42,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:42,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:42,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 2011 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-06 12:03:42,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:42,471 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:03:42,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:42,511 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:42,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 12:03:42,528 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-02-06 12:03:42,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:42,546 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:42,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-06 12:03:42,554 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 23 treesize of output 1 [2025-02-06 12:03:42,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 28 [2025-02-06 12:03:43,112 INFO L349 Elim1Store]: treesize reduction 50, result has 71.6 percent of original size [2025-02-06 12:03:43,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 44 treesize of output 156 [2025-02-06 12:03:50,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 501 proven. 14 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2025-02-06 12:03:50,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:51,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 94 proven. 545 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-02-06 12:03:51,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540011865] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:51,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:51,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 11] total 22 [2025-02-06 12:03:51,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888624604] [2025-02-06 12:03:51,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:51,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 12:03:51,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:51,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 12:03:51,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:03:51,406 INFO L87 Difference]: Start difference. First operand 381 states and 393 transitions. Second operand has 23 states, 22 states have (on average 6.136363636363637) internal successors, (135), 23 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:03:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:51,458 INFO L93 Difference]: Finished difference Result 380 states and 392 transitions. [2025-02-06 12:03:51,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:03:51,459 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.136363636363637) internal successors, (135), 23 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 174 [2025-02-06 12:03:51,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:51,460 INFO L225 Difference]: With dead ends: 380 [2025-02-06 12:03:51,460 INFO L226 Difference]: Without dead ends: 380 [2025-02-06 12:03:51,460 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 337 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:03:51,461 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 244 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:51,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 52 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:51,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-02-06 12:03:51,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-02-06 12:03:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 372 states have (on average 1.0483870967741935) internal successors, (390), 377 states have internal predecessors, (390), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 392 transitions. [2025-02-06 12:03:51,465 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 392 transitions. Word has length 174 [2025-02-06 12:03:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:51,465 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 392 transitions. [2025-02-06 12:03:51,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.136363636363637) internal successors, (135), 23 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:03:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 392 transitions. [2025-02-06 12:03:51,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-06 12:03:51,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:51,466 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 20, 20, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:51,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-06 12:03:51,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-02-06 12:03:51,670 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-06 12:03:51,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:51,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2040608427, now seen corresponding path program 1 times [2025-02-06 12:03:51,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:51,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858577454] [2025-02-06 12:03:51,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:51,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:51,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 12:03:51,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 12:03:51,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:51,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-06 12:03:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858577454] [2025-02-06 12:03:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858577454] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:52,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773184029] [2025-02-06 12:03:52,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:52,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:52,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:52,963 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:52,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 12:03:53,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-06 12:03:53,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-06 12:03:53,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:53,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:53,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 2013 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 12:03:53,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:53,703 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 12:03:53,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-06 12:03:53,707 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-06 12:03:53,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:53,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:53,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2025-02-06 12:03:53,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:53,876 INFO L349 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2025-02-06 12:03:53,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 28 [2025-02-06 12:03:53,953 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 12:03:53,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 12:03:53,979 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-02-06 12:03:53,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-02-06 12:03:54,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 12:03:55,007 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-02-06 12:03:55,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-02-06 12:03:55,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 12:03:55,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2025-02-06 12:03:56,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:03:56,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 20 [2025-02-06 12:03:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 615 trivial. 0 not checked. [2025-02-06 12:03:56,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:57,520 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 30 treesize of output 28 [2025-02-06 12:03:57,524 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 60 treesize of output 56