./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-48c9605-m [2025-02-08 07:40:49,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:40:49,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 07:40:49,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:40:49,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:40:49,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:40:49,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:40:49,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:40:49,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:40:49,859 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:40:49,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:40:49,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:40:49,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:40:49,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:40:49,861 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:40:49,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:40:49,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:40:49,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:40:49,861 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:40:49,861 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:40:49,861 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:40:49,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:40:49,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:40:49,862 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:40:49,862 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:40:49,862 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:40:49,862 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:40:49,862 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:40:49,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:40:49,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:40:49,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:49,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:40:49,863 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:40:49,863 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:40:49,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:40:49,863 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:40:49,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:40:49,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:40:49,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:40:49,863 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-08 07:40:50,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:40:50,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:40:50,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:40:50,100 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:40:50,100 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:40:50,101 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-08 07:40:51,357 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/968f80ef3/104cc023607f41a496c2af36275ae035/FLAG45ab520bb [2025-02-08 07:40:51,703 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:40:51,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/dirname-1.i [2025-02-08 07:40:51,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/968f80ef3/104cc023607f41a496c2af36275ae035/FLAG45ab520bb [2025-02-08 07:40:51,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/968f80ef3/104cc023607f41a496c2af36275ae035 [2025-02-08 07:40:51,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:40:51,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:40:51,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:51,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:40:51,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:40:51,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:51" (1/1) ... [2025-02-08 07:40:51,947 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f564414 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:51, skipping insertion in model container [2025-02-08 07:40:51,947 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:40:51" (1/1) ... [2025-02-08 07:40:51,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:40:52,330 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-08 07:40:52,338 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-08 07:40:52,338 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-08 07:40:52,342 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-08 07:40:52,359 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-08 07:40:52,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:52,401 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:40:52,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:40:52,545 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:40:52,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52 WrapperNode [2025-02-08 07:40:52,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:40:52,547 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:52,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:40:52,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:40:52,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,566 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,618 INFO L138 Inliner]: procedures = 344, calls = 498, calls flagged for inlining = 8, calls inlined = 7, statements flattened = 648 [2025-02-08 07:40:52,619 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:40:52,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:40:52,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:40:52,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:40:52,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,658 INFO L175 MemorySlicer]: Split 450 memory accesses to 15 slices as follows [2, 3, 3, 3, 4, 4, 4, 4, 3, 44, 355, 2, 2, 6, 11]. 79 percent of accesses are in the largest equivalence class. The 423 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 3, 42, 355, 0, 0, 0, 0]. The 9 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 1, 2, 2, 2]. [2025-02-08 07:40:52,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,679 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:40:52,690 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:40:52,690 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:40:52,690 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:40:52,691 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (1/1) ... [2025-02-08 07:40:52,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:40:52,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:52,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:40:52,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:40:52,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 07:40:52,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 07:40:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:40:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:40:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 07:40:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-08 07:40:52,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 07:40:52,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 07:40:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 07:40:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 07:40:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-08 07:40:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-08 07:40:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-08 07:40:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-08 07:40:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-08 07:40:52,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:40:52,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-08 07:40:52,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:40:52,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:40:52,915 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:40:52,916 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:40:53,364 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1231: havoc single_argv_#t~mem89#1.base, single_argv_#t~mem89#1.offset; [2025-02-08 07:40:53,389 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-02-08 07:40:53,391 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:40:53,403 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:40:53,404 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 07:40:53,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:53 BoogieIcfgContainer [2025-02-08 07:40:53,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:40:53,406 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:40:53,406 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:40:53,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:40:53,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:40:51" (1/3) ... [2025-02-08 07:40:53,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f57abd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:40:53, skipping insertion in model container [2025-02-08 07:40:53,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:40:52" (2/3) ... [2025-02-08 07:40:53,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f57abd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:40:53, skipping insertion in model container [2025-02-08 07:40:53,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:40:53" (3/3) ... [2025-02-08 07:40:53,411 INFO L128 eAbstractionObserver]: Analyzing ICFG dirname-1.i [2025-02-08 07:40:53,421 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:40:53,422 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dirname-1.i that has 2 procedures, 172 locations, 1 initial locations, 6 loop locations, and 74 error locations. [2025-02-08 07:40:53,454 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:40:53,465 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;@7f9adb03, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:40:53,466 INFO L334 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2025-02-08 07:40:53,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 172 states, 94 states have (on average 2.0) internal successors, (188), 169 states have internal predecessors, (188), 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-08 07:40:53,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:40:53,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:53,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:40:53,474 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-08 07:40:53,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:53,479 INFO L85 PathProgramCache]: Analyzing trace with hash 7039, now seen corresponding path program 1 times [2025-02-08 07:40:53,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:53,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723253829] [2025-02-08 07:40:53,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:53,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:40:53,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:40:53,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:53,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723253829] [2025-02-08 07:40:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723253829] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:53,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:53,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:40:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678419724] [2025-02-08 07:40:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:53,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:53,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:53,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:53,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:53,969 INFO L87 Difference]: Start difference. First operand has 172 states, 94 states have (on average 2.0) internal successors, (188), 169 states have internal predecessors, (188), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,063 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2025-02-08 07:40:54,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:54,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:40:54,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,073 INFO L225 Difference]: With dead ends: 80 [2025-02-08 07:40:54,076 INFO L226 Difference]: Without dead ends: 77 [2025-02-08 07:40:54,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:54,084 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 75 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 53 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-08 07:40:54,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-02-08 07:40:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 74 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-08 07:40:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2025-02-08 07:40:54,140 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 2 [2025-02-08 07:40:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,140 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2025-02-08 07:40:54,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2025-02-08 07:40:54,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 07:40:54,141 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 07:40:54,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:40:54,142 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-08 07:40:54,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,143 INFO L85 PathProgramCache]: Analyzing trace with hash 7040, now seen corresponding path program 1 times [2025-02-08 07:40:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782899892] [2025-02-08 07:40:54,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 07:40:54,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 07:40:54,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:54,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:54,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782899892] [2025-02-08 07:40:54,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782899892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:54,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:54,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 07:40:54,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932909476] [2025-02-08 07:40:54,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:54,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:54,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:54,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:54,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:54,368 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,426 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-02-08 07:40:54,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:54,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 07:40:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,427 INFO L225 Difference]: With dead ends: 76 [2025-02-08 07:40:54,427 INFO L226 Difference]: Without dead ends: 76 [2025-02-08 07:40:54,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:54,428 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-02-08 07:40:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-02-08 07:40:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 73 states have internal predecessors, (79), 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-08 07:40:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2025-02-08 07:40:54,435 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 2 [2025-02-08 07:40:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,435 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2025-02-08 07:40:54,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2025-02-08 07:40:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 07:40:54,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,436 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 07:40:54,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:40:54,436 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-08 07:40:54,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,437 INFO L85 PathProgramCache]: Analyzing trace with hash 209853723, now seen corresponding path program 1 times [2025-02-08 07:40:54,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111801243] [2025-02-08 07:40:54,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 07:40:54,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 07:40:54,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:54,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:54,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:54,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111801243] [2025-02-08 07:40:54,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111801243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:54,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:54,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:54,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569689190] [2025-02-08 07:40:54,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:54,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:40:54,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:54,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:40:54,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:54,710 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:54,805 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2025-02-08 07:40:54,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:40:54,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-02-08 07:40:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:54,806 INFO L225 Difference]: With dead ends: 79 [2025-02-08 07:40:54,806 INFO L226 Difference]: Without dead ends: 79 [2025-02-08 07:40:54,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:54,807 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:54,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 156 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:54,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-08 07:40:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2025-02-08 07:40:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 46 states have (on average 1.7608695652173914) internal successors, (81), 75 states have internal predecessors, (81), 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-08 07:40:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2025-02-08 07:40:54,811 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 5 [2025-02-08 07:40:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:54,811 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2025-02-08 07:40:54,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2025-02-08 07:40:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 07:40:54,812 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:54,812 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:54,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:40:54,812 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-08 07:40:54,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1720000805, now seen corresponding path program 1 times [2025-02-08 07:40:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:54,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368405931] [2025-02-08 07:40:54,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:54,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:54,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:54,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:54,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:55,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:55,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368405931] [2025-02-08 07:40:55,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368405931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:55,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021549145] [2025-02-08 07:40:55,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:55,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:55,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:40:55,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 07:40:55,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 07:40:55,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:55,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:55,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:40:55,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:55,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:55,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:55,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 07:40:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:55,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021549145] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:55,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:55,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-02-08 07:40:55,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917081196] [2025-02-08 07:40:55,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:55,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:40:55,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:55,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:40:55,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:40:55,438 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:55,650 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2025-02-08 07:40:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:40:55,650 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 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 8 [2025-02-08 07:40:55,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:55,651 INFO L225 Difference]: With dead ends: 82 [2025-02-08 07:40:55,651 INFO L226 Difference]: Without dead ends: 82 [2025-02-08 07:40:55,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 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-08 07:40:55,652 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 143 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:55,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 403 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:40:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-08 07:40:55,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-08 07:40:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 79 states have internal predecessors, (85), 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-08 07:40:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2025-02-08 07:40:55,655 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 8 [2025-02-08 07:40:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:55,655 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2025-02-08 07:40:55,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:40:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2025-02-08 07:40:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 07:40:55,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:55,656 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:55,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 07:40:55,860 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-08 07:40:55,860 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-08 07:40:55,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:55,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1143107811, now seen corresponding path program 1 times [2025-02-08 07:40:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:55,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201266067] [2025-02-08 07:40:55,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:55,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:55,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 07:40:55,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 07:40:55,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:55,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:56,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:56,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201266067] [2025-02-08 07:40:56,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201266067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:56,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277274171] [2025-02-08 07:40:56,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:56,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:56,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:56,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:56,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:40:56,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 07:40:56,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 07:40:56,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:56,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:56,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 07:40:56,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:56,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:40:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277274171] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:56,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:56,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-02-08 07:40:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917816141] [2025-02-08 07:40:56,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:56,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:40:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:56,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:40:56,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:40:56,351 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-08 07:40:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:56,398 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2025-02-08 07:40:56,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:40:56,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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 20 [2025-02-08 07:40:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:56,399 INFO L225 Difference]: With dead ends: 97 [2025-02-08 07:40:56,399 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 07:40:56,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:40:56,400 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:56,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 373 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 07:40:56,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 07:40:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 94 states have internal predecessors, (100), 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-08 07:40:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2025-02-08 07:40:56,403 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 20 [2025-02-08 07:40:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:56,404 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2025-02-08 07:40:56,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 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-08 07:40:56,404 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2025-02-08 07:40:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:40:56,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:56,404 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:56,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:40:56,605 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-08 07:40:56,605 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-08 07:40:56,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:56,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1293203677, now seen corresponding path program 2 times [2025-02-08 07:40:56,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:56,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742748391] [2025-02-08 07:40:56,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:40:56,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:56,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 07:40:56,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 35 statements. [2025-02-08 07:40:56,644 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:40:56,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-08 07:40:56,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:56,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742748391] [2025-02-08 07:40:56,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742748391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:56,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:56,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892386399] [2025-02-08 07:40:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:56,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:56,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:56,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:56,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:56,759 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 07:40:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:56,807 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2025-02-08 07:40:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:56,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 35 [2025-02-08 07:40:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:56,808 INFO L225 Difference]: With dead ends: 92 [2025-02-08 07:40:56,808 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 07:40:56,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:56,808 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 56 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:56,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 54 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:56,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 07:40:56,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 07:40:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 89 states have internal predecessors, (95), 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-08 07:40:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2025-02-08 07:40:56,812 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 35 [2025-02-08 07:40:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:56,812 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2025-02-08 07:40:56,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 07:40:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2025-02-08 07:40:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 07:40:56,813 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:56,813 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:56,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:40:56,813 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-08 07:40:56,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1293203676, now seen corresponding path program 1 times [2025-02-08 07:40:56,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:56,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374614145] [2025-02-08 07:40:56,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:56,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 07:40:56,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 07:40:56,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:56,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:57,113 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-08 07:40:57,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374614145] [2025-02-08 07:40:57,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374614145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:40:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26706532] [2025-02-08 07:40:57,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:57,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:40:57,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:40:57,117 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:40:57,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:40:57,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 07:40:57,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 07:40:57,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:57,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:57,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 07:40:57,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:40:57,369 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-08 07:40:57,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:40:57,470 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-08 07:40:57,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26706532] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:40:57,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:40:57,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-02-08 07:40:57,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515511486] [2025-02-08 07:40:57,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:40:57,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:40:57,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:57,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:40:57,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:40:57,471 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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-08 07:40:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:57,521 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2025-02-08 07:40:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:40:57,521 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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 35 [2025-02-08 07:40:57,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:57,522 INFO L225 Difference]: With dead ends: 98 [2025-02-08 07:40:57,522 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 07:40:57,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 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-08 07:40:57,523 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:57,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 348 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 07:40:57,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 07:40:57,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 95 states have internal predecessors, (101), 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-08 07:40:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2025-02-08 07:40:57,526 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 35 [2025-02-08 07:40:57,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:57,527 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2025-02-08 07:40:57,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 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-08 07:40:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2025-02-08 07:40:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 07:40:57,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:57,527 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:57,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 07:40:57,732 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-08 07:40:57,732 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-08 07:40:57,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:57,733 INFO L85 PathProgramCache]: Analyzing trace with hash 673771300, now seen corresponding path program 2 times [2025-02-08 07:40:57,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:57,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129765828] [2025-02-08 07:40:57,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:40:57,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:57,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-02-08 07:40:57,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 41 statements. [2025-02-08 07:40:57,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 07:40:57,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:58,063 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-08 07:40:58,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:58,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129765828] [2025-02-08 07:40:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129765828] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:58,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:58,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:40:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534396533] [2025-02-08 07:40:58,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:58,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:58,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:58,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:58,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:58,065 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-08 07:40:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:58,157 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2025-02-08 07:40:58,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:58,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 41 [2025-02-08 07:40:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:58,158 INFO L225 Difference]: With dead ends: 129 [2025-02-08 07:40:58,158 INFO L226 Difference]: Without dead ends: 129 [2025-02-08 07:40:58,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-08 07:40:58,159 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 96 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:58,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 208 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-02-08 07:40:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 97. [2025-02-08 07:40:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 94 states have internal predecessors, (100), 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-08 07:40:58,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2025-02-08 07:40:58,162 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 41 [2025-02-08 07:40:58,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:58,162 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2025-02-08 07:40:58,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-08 07:40:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2025-02-08 07:40:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 07:40:58,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:58,163 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:58,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 07:40:58,163 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:40:58,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:58,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1938736330, now seen corresponding path program 1 times [2025-02-08 07:40:58,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:58,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304854902] [2025-02-08 07:40:58,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:58,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 07:40:58,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 07:40:58,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:58,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:58,339 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-08 07:40:58,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:58,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304854902] [2025-02-08 07:40:58,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304854902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:58,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:58,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:40:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066438629] [2025-02-08 07:40:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:58,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:40:58,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:58,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:40:58,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:40:58,341 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-08 07:40:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:58,400 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2025-02-08 07:40:58,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:40:58,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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 44 [2025-02-08 07:40:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:58,401 INFO L225 Difference]: With dead ends: 93 [2025-02-08 07:40:58,401 INFO L226 Difference]: Without dead ends: 93 [2025-02-08 07:40:58,401 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-08 07:40:58,402 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 60 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:58,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 79 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:58,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-08 07:40:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-08 07:40:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 90 states have internal predecessors, (96), 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-08 07:40:58,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2025-02-08 07:40:58,404 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 44 [2025-02-08 07:40:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:58,405 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2025-02-08 07:40:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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-08 07:40:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2025-02-08 07:40:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 07:40:58,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:58,405 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:58,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:40:58,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:40:58,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1938736331, now seen corresponding path program 1 times [2025-02-08 07:40:58,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:58,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151997208] [2025-02-08 07:40:58,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:58,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:58,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 07:40:58,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 07:40:58,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:58,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:58,607 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-08 07:40:58,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:58,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151997208] [2025-02-08 07:40:58,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151997208] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:58,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:58,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:40:58,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585477305] [2025-02-08 07:40:58,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:58,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:58,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:58,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:58,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:58,609 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-08 07:40:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:58,662 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2025-02-08 07:40:58,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:58,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 44 [2025-02-08 07:40:58,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:58,663 INFO L225 Difference]: With dead ends: 112 [2025-02-08 07:40:58,663 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 07:40:58,663 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-08 07:40:58,664 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 99 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:58,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 204 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:58,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 07:40:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2025-02-08 07:40:58,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 91 states have internal predecessors, (97), 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-08 07:40:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2025-02-08 07:40:58,667 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 44 [2025-02-08 07:40:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:58,667 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2025-02-08 07:40:58,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-08 07:40:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2025-02-08 07:40:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 07:40:58,668 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:58,668 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:40:58,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:40:58,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:40:58,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:58,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1938737259, now seen corresponding path program 1 times [2025-02-08 07:40:58,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:58,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499984933] [2025-02-08 07:40:58,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:58,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:58,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 07:40:58,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 07:40:58,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:58,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:58,930 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-08 07:40:58,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:58,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499984933] [2025-02-08 07:40:58,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499984933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:58,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:58,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:40:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625184292] [2025-02-08 07:40:58,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:58,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:40:58,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:58,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:40:58,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:40:58,932 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-08 07:40:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:59,037 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2025-02-08 07:40:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:40:59,037 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 44 [2025-02-08 07:40:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:59,038 INFO L225 Difference]: With dead ends: 112 [2025-02-08 07:40:59,038 INFO L226 Difference]: Without dead ends: 112 [2025-02-08 07:40:59,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:40:59,039 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 177 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:59,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 88 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:59,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-08 07:40:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2025-02-08 07:40:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 104 states have internal predecessors, (117), 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-08 07:40:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 119 transitions. [2025-02-08 07:40:59,042 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 119 transitions. Word has length 44 [2025-02-08 07:40:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:59,042 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 119 transitions. [2025-02-08 07:40:59,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-08 07:40:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 119 transitions. [2025-02-08 07:40:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 07:40:59,043 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:59,043 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] [2025-02-08 07:40:59,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:40:59,043 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-08 07:40:59,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:59,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1798405602, now seen corresponding path program 1 times [2025-02-08 07:40:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:59,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073609425] [2025-02-08 07:40:59,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:59,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 07:40:59,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 07:40:59,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:59,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:59,229 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-08 07:40:59,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:59,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073609425] [2025-02-08 07:40:59,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073609425] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:59,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:59,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:40:59,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733986070] [2025-02-08 07:40:59,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:59,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:40:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:59,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:40:59,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:59,230 INFO L87 Difference]: Start difference. First operand 107 states and 119 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 07:40:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:59,265 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2025-02-08 07:40:59,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:40:59,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 47 [2025-02-08 07:40:59,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:59,266 INFO L225 Difference]: With dead ends: 106 [2025-02-08 07:40:59,266 INFO L226 Difference]: Without dead ends: 106 [2025-02-08 07:40:59,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:40:59,267 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 49 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:59,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:40:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-08 07:40:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-08 07:40:59,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 103 states have internal predecessors, (115), 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-08 07:40:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2025-02-08 07:40:59,270 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 47 [2025-02-08 07:40:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:59,270 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2025-02-08 07:40:59,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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-08 07:40:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2025-02-08 07:40:59,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 07:40:59,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:59,271 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] [2025-02-08 07:40:59,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:40:59,271 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-08 07:40:59,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1798405601, now seen corresponding path program 1 times [2025-02-08 07:40:59,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:59,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003567373] [2025-02-08 07:40:59,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:59,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:59,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-08 07:40:59,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 07:40:59,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:59,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:40:59,806 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-08 07:40:59,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:40:59,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003567373] [2025-02-08 07:40:59,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003567373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:40:59,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:40:59,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 07:40:59,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005944271] [2025-02-08 07:40:59,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:40:59,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 07:40:59,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:40:59,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 07:40:59,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:40:59,808 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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-08 07:40:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:40:59,958 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2025-02-08 07:40:59,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:40:59,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 47 [2025-02-08 07:40:59,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:40:59,959 INFO L225 Difference]: With dead ends: 110 [2025-02-08 07:40:59,959 INFO L226 Difference]: Without dead ends: 110 [2025-02-08 07:40:59,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-08 07:40:59,960 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 29 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:40:59,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 211 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:40:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-08 07:40:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2025-02-08 07:40:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 103 states have internal predecessors, (114), 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-08 07:40:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2025-02-08 07:40:59,963 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 47 [2025-02-08 07:40:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:40:59,963 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2025-02-08 07:40:59,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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-08 07:40:59,963 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2025-02-08 07:40:59,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 07:40:59,965 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:40:59,966 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] [2025-02-08 07:40:59,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:40:59,966 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-08 07:40:59,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:40:59,966 INFO L85 PathProgramCache]: Analyzing trace with hash -879107901, now seen corresponding path program 1 times [2025-02-08 07:40:59,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:40:59,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526279069] [2025-02-08 07:40:59,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:40:59,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:40:59,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 07:40:59,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 07:40:59,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:40:59,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:00,175 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-08 07:41:00,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:00,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526279069] [2025-02-08 07:41:00,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526279069] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:00,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:00,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:00,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318211496] [2025-02-08 07:41:00,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:00,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:41:00,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:00,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:41:00,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:00,177 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-08 07:41:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:00,254 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2025-02-08 07:41:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 50 [2025-02-08 07:41:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:00,255 INFO L225 Difference]: With dead ends: 105 [2025-02-08 07:41:00,255 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 07:41:00,256 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-08 07:41:00,256 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:00,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 161 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 07:41:00,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-08 07:41:00,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.302325581395349) internal successors, (112), 102 states have internal predecessors, (112), 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-08 07:41:00,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2025-02-08 07:41:00,258 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 50 [2025-02-08 07:41:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:00,259 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2025-02-08 07:41:00,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-08 07:41:00,259 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2025-02-08 07:41:00,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-08 07:41:00,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:00,259 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] [2025-02-08 07:41:00,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:41:00,260 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-08 07:41:00,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:00,260 INFO L85 PathProgramCache]: Analyzing trace with hash -879107900, now seen corresponding path program 1 times [2025-02-08 07:41:00,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:00,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877711800] [2025-02-08 07:41:00,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:00,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:00,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 07:41:00,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 07:41:00,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:00,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:00,599 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-08 07:41:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:00,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877711800] [2025-02-08 07:41:00,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877711800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:00,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:00,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:00,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930431977] [2025-02-08 07:41:00,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:00,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:41:00,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:00,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:41:00,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:00,601 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-08 07:41:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:00,684 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-02-08 07:41:00,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 50 [2025-02-08 07:41:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:00,684 INFO L225 Difference]: With dead ends: 104 [2025-02-08 07:41:00,685 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 07:41:00,685 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-08 07:41:00,685 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 11 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:00,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 147 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 07:41:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-02-08 07:41:00,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.2790697674418605) internal successors, (110), 101 states have internal predecessors, (110), 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-08 07:41:00,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2025-02-08 07:41:00,687 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 50 [2025-02-08 07:41:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:00,687 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2025-02-08 07:41:00,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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-08 07:41:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2025-02-08 07:41:00,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 07:41:00,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:00,688 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] [2025-02-08 07:41:00,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 07:41:00,688 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:00,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1231005801, now seen corresponding path program 1 times [2025-02-08 07:41:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:00,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879822280] [2025-02-08 07:41:00,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:00,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 07:41:00,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 07:41:00,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:00,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:00,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:00,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879822280] [2025-02-08 07:41:00,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879822280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:00,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:00,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:41:00,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783206375] [2025-02-08 07:41:00,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:00,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:41:00,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:00,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:41:00,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:00,774 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-08 07:41:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:00,794 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2025-02-08 07:41:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:41:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 54 [2025-02-08 07:41:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:00,796 INFO L225 Difference]: With dead ends: 116 [2025-02-08 07:41:00,796 INFO L226 Difference]: Without dead ends: 116 [2025-02-08 07:41:00,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:41:00,796 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:00,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-02-08 07:41:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 106. [2025-02-08 07:41:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 103 states have internal predecessors, (112), 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-08 07:41:00,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2025-02-08 07:41:00,799 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 54 [2025-02-08 07:41:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:00,799 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2025-02-08 07:41:00,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-08 07:41:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2025-02-08 07:41:00,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 07:41:00,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:00,800 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] [2025-02-08 07:41:00,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:41:00,800 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-08 07:41:00,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 493801044, now seen corresponding path program 1 times [2025-02-08 07:41:00,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:00,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081707528] [2025-02-08 07:41:00,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:00,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:00,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 07:41:00,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 07:41:00,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:00,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:00,916 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-08 07:41:00,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:00,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081707528] [2025-02-08 07:41:00,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081707528] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:00,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:00,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:41:00,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828106262] [2025-02-08 07:41:00,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:00,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:41:00,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:00,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:41:00,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:00,917 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-08 07:41:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:00,980 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2025-02-08 07:41:00,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:00,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-08 07:41:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:00,981 INFO L225 Difference]: With dead ends: 105 [2025-02-08 07:41:00,981 INFO L226 Difference]: Without dead ends: 105 [2025-02-08 07:41:00,982 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-08 07:41:00,982 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:00,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-08 07:41:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-02-08 07:41:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.25) internal successors, (110), 102 states have internal predecessors, (110), 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-08 07:41:00,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2025-02-08 07:41:00,984 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 55 [2025-02-08 07:41:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:00,984 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2025-02-08 07:41:00,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-08 07:41:00,985 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2025-02-08 07:41:00,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-08 07:41:00,985 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:00,985 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] [2025-02-08 07:41:00,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:41:00,985 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-08 07:41:00,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:00,986 INFO L85 PathProgramCache]: Analyzing trace with hash 493801045, now seen corresponding path program 1 times [2025-02-08 07:41:00,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:00,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84504830] [2025-02-08 07:41:00,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:01,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 07:41:01,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 07:41:01,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:01,521 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-08 07:41:01,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:01,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84504830] [2025-02-08 07:41:01,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84504830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:01,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:01,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:41:01,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15568127] [2025-02-08 07:41:01,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:01,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:41:01,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:01,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:41:01,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:01,523 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-08 07:41:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:01,635 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2025-02-08 07:41:01,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 07:41:01,635 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-08 07:41:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:01,636 INFO L225 Difference]: With dead ends: 113 [2025-02-08 07:41:01,636 INFO L226 Difference]: Without dead ends: 113 [2025-02-08 07:41:01,636 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-08 07:41:01,637 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 14 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:01,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 144 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:01,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-08 07:41:01,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2025-02-08 07:41:01,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 108 states have internal predecessors, (117), 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-08 07:41:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2025-02-08 07:41:01,640 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 55 [2025-02-08 07:41:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:01,640 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2025-02-08 07:41:01,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 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-08 07:41:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2025-02-08 07:41:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 07:41:01,640 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:01,641 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, 1, 1, 1] [2025-02-08 07:41:01,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:41:01,641 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:01,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:01,641 INFO L85 PathProgramCache]: Analyzing trace with hash 305003857, now seen corresponding path program 1 times [2025-02-08 07:41:01,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:01,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433172038] [2025-02-08 07:41:01,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:01,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:01,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 07:41:01,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 07:41:01,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:01,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:01,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433172038] [2025-02-08 07:41:01,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433172038] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213496626] [2025-02-08 07:41:01,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:01,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:01,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:01,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:01,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:41:01,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 07:41:02,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 07:41:02,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:02,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:02,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1349 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 07:41:02,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:02,035 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:02,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:02,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213496626] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:02,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:02,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 07:41:02,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184600580] [2025-02-08 07:41:02,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:02,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:41:02,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:02,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:41:02,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:41:02,056 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-08 07:41:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:02,088 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2025-02-08 07:41:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:41:02,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 59 [2025-02-08 07:41:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:02,089 INFO L225 Difference]: With dead ends: 138 [2025-02-08 07:41:02,089 INFO L226 Difference]: Without dead ends: 138 [2025-02-08 07:41:02,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 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-08 07:41:02,090 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 12 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:02,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 298 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:02,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-08 07:41:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-02-08 07:41:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 118 states have (on average 1.2457627118644068) internal successors, (147), 132 states have internal predecessors, (147), 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-08 07:41:02,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2025-02-08 07:41:02,092 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 59 [2025-02-08 07:41:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:02,092 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2025-02-08 07:41:02,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-08 07:41:02,093 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2025-02-08 07:41:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 07:41:02,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:02,093 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] [2025-02-08 07:41:02,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:02,297 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-08 07:41:02,297 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-08 07:41:02,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash 865460187, now seen corresponding path program 1 times [2025-02-08 07:41:02,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:02,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619737708] [2025-02-08 07:41:02,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:02,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:02,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 07:41:02,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 07:41:02,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:02,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:02,837 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-08 07:41:02,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:02,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619737708] [2025-02-08 07:41:02,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619737708] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:02,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551330103] [2025-02-08 07:41:02,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:02,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:02,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:02,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:02,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:41:02,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 07:41:03,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 07:41:03,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:03,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:03,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 07:41:03,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:03,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:41:03,148 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-08 07:41:03,152 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-08 07:41:03,306 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-08 07:41:03,313 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-08 07:41:03,345 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-08 07:41:03,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:03,562 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-08 07:41:03,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551330103] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:03,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-02-08 07:41:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014143380] [2025-02-08 07:41:03,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:03,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 07:41:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:03,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 07:41:03,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2025-02-08 07:41:03,564 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 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-08 07:41:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:04,032 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2025-02-08 07:41:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:41:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 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-08 07:41:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:04,034 INFO L225 Difference]: With dead ends: 134 [2025-02-08 07:41:04,034 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 07:41:04,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2025-02-08 07:41:04,035 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 34 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:04,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 466 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:41:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 07:41:04,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2025-02-08 07:41:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 118 states have (on average 1.194915254237288) internal successors, (141), 131 states have internal predecessors, (141), 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-08 07:41:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 143 transitions. [2025-02-08 07:41:04,037 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 143 transitions. Word has length 60 [2025-02-08 07:41:04,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:04,037 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 143 transitions. [2025-02-08 07:41:04,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 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-08 07:41:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2025-02-08 07:41:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-08 07:41:04,037 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:04,037 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:04,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:04,238 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-08 07:41:04,238 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:04,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1186918377, now seen corresponding path program 2 times [2025-02-08 07:41:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:04,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86013768] [2025-02-08 07:41:04,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:04,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-02-08 07:41:04,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 07:41:04,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:41:04,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:04,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86013768] [2025-02-08 07:41:04,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86013768] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799512509] [2025-02-08 07:41:04,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:04,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:04,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:04,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:04,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:41:04,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 74 statements into 2 equivalence classes. [2025-02-08 07:41:04,707 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 07:41:04,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:41:04,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:04,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 1436 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 07:41:04,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:04,770 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:04,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 07:41:04,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799512509] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:04,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:04,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-08 07:41:04,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347355059] [2025-02-08 07:41:04,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:04,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:41:04,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:04,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:41:04,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:41:04,844 INFO L87 Difference]: Start difference. First operand 134 states and 143 transitions. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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-08 07:41:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:04,892 INFO L93 Difference]: Finished difference Result 203 states and 209 transitions. [2025-02-08 07:41:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:41:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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 74 [2025-02-08 07:41:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:04,894 INFO L225 Difference]: With dead ends: 203 [2025-02-08 07:41:04,894 INFO L226 Difference]: Without dead ends: 203 [2025-02-08 07:41:04,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 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-08 07:41:04,895 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:04,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 260 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-08 07:41:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 194. [2025-02-08 07:41:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 178 states have (on average 1.1629213483146068) internal successors, (207), 191 states have internal predecessors, (207), 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-08 07:41:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 209 transitions. [2025-02-08 07:41:04,902 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 209 transitions. Word has length 74 [2025-02-08 07:41:04,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:04,902 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 209 transitions. [2025-02-08 07:41:04,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 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-08 07:41:04,902 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 209 transitions. [2025-02-08 07:41:04,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 07:41:04,903 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:04,903 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] [2025-02-08 07:41:04,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:05,103 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-08 07:41:05,104 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:05,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:05,104 INFO L85 PathProgramCache]: Analyzing trace with hash 808176855, now seen corresponding path program 3 times [2025-02-08 07:41:05,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:05,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368575398] [2025-02-08 07:41:05,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:05,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:05,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 12 equivalence classes. [2025-02-08 07:41:05,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 104 statements. [2025-02-08 07:41:05,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 07:41:05,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:05,625 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-08 07:41:05,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:05,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368575398] [2025-02-08 07:41:05,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368575398] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:05,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000284042] [2025-02-08 07:41:05,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:05,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:05,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:05,628 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:05,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:41:05,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 104 statements into 12 equivalence classes. [2025-02-08 07:41:05,932 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 27 of 104 statements. [2025-02-08 07:41:05,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 07:41:05,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:05,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 07:41:05,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:06,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:06,004 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-08 07:41:06,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:06,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:06,188 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-08 07:41:06,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:06,511 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-08 07:41:06,531 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-08 07:41:06,532 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-08 07:41:06,571 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-08 07:41:06,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000284042] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:06,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:06,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 20 [2025-02-08 07:41:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501972500] [2025-02-08 07:41:06,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:06,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 07:41:06,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:06,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 07:41:06,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-02-08 07:41:06,573 INFO L87 Difference]: Start difference. First operand 194 states and 209 transitions. Second operand has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:41:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:06,908 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2025-02-08 07:41:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:41:06,909 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-02-08 07:41:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:06,909 INFO L225 Difference]: With dead ends: 191 [2025-02-08 07:41:06,909 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 07:41:06,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2025-02-08 07:41:06,911 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 280 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:06,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 272 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 07:41:06,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2025-02-08 07:41:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 178 states have (on average 1.146067415730337) internal successors, (204), 188 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-08 07:41:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2025-02-08 07:41:06,918 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 104 [2025-02-08 07:41:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:06,918 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2025-02-08 07:41:06,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.65) internal successors, (73), 21 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:41:06,919 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2025-02-08 07:41:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 07:41:06,919 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:06,919 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] [2025-02-08 07:41:06,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 07:41:07,124 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-08 07:41:07,124 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:07,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:07,125 INFO L85 PathProgramCache]: Analyzing trace with hash 808177783, now seen corresponding path program 1 times [2025-02-08 07:41:07,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:07,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918945674] [2025-02-08 07:41:07,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:07,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:07,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 07:41:07,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 07:41:07,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:07,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:07,657 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-08 07:41:07,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:07,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918945674] [2025-02-08 07:41:07,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918945674] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:07,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045836646] [2025-02-08 07:41:07,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:07,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:07,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:07,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:07,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:41:07,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 07:41:08,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 07:41:08,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:08,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:08,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 07:41:08,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:08,110 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 07:41:08,111 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 19 treesize of output 18 [2025-02-08 07:41:08,122 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:08,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:08,147 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-08 07:41:08,594 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 8 treesize of output 4 [2025-02-08 07:41:08,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:08,646 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-08 07:41:08,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:08,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-02-08 07:41:08,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:09,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:09,458 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-08 07:41:09,559 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-08 07:41:09,577 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-08 07:41:09,577 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-08 07:41:09,622 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-08 07:41:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045836646] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:09,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:09,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2025-02-08 07:41:09,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002955548] [2025-02-08 07:41:09,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:09,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 07:41:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:09,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 07:41:09,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2025-02-08 07:41:09,628 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 22 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-08 07:41:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:09,990 INFO L93 Difference]: Finished difference Result 307 states and 319 transitions. [2025-02-08 07:41:09,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:41:09,991 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 22 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 104 [2025-02-08 07:41:09,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:09,992 INFO L225 Difference]: With dead ends: 307 [2025-02-08 07:41:09,992 INFO L226 Difference]: Without dead ends: 307 [2025-02-08 07:41:09,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=579, Unknown=0, NotChecked=0, Total=812 [2025-02-08 07:41:09,993 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 494 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:09,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 235 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-02-08 07:41:09,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 132. [2025-02-08 07:41:09,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 123 states have (on average 1.0975609756097562) internal successors, (135), 129 states have internal predecessors, (135), 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-08 07:41:09,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2025-02-08 07:41:09,996 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 104 [2025-02-08 07:41:09,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:09,996 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2025-02-08 07:41:09,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 22 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-08 07:41:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2025-02-08 07:41:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-08 07:41:09,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:09,997 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] [2025-02-08 07:41:10,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:10,201 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-08 07:41:10,201 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-08 07:41:10,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:10,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1162219885, now seen corresponding path program 1 times [2025-02-08 07:41:10,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:10,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370793931] [2025-02-08 07:41:10,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:10,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:10,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 07:41:10,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 07:41:10,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:10,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:11,065 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-08 07:41:11,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:11,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370793931] [2025-02-08 07:41:11,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370793931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:11,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518388773] [2025-02-08 07:41:11,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:11,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:11,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:11,068 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:11,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 07:41:11,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-08 07:41:11,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-08 07:41:11,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:11,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:11,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 07:41:11,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:11,414 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-08 07:41:11,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:41:11,441 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-08 07:41:11,441 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-08 07:41:11,626 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2025-02-08 07:41:11,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 45 [2025-02-08 07:41:11,654 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:11,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:11,721 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-08 07:41:12,362 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 28 treesize of output 20 [2025-02-08 07:41:12,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:12,873 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-08 07:41:12,886 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:12,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-02-08 07:41:13,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:13,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:41:13,735 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-08 07:41:13,971 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-08 07:41:13,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518388773] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:13,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:13,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-02-08 07:41:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687075932] [2025-02-08 07:41:13,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:13,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 07:41:13,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:13,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 07:41:13,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:41:13,975 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 25 states have internal predecessors, (85), 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-08 07:41:14,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:14,481 INFO L93 Difference]: Finished difference Result 246 states and 254 transitions. [2025-02-08 07:41:14,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:41:14,481 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 25 states have internal predecessors, (85), 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 107 [2025-02-08 07:41:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:14,482 INFO L225 Difference]: With dead ends: 246 [2025-02-08 07:41:14,482 INFO L226 Difference]: Without dead ends: 246 [2025-02-08 07:41:14,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=954, Unknown=0, NotChecked=0, Total=1190 [2025-02-08 07:41:14,483 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 260 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:14,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 256 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:14,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-08 07:41:14,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 127. [2025-02-08 07:41:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 119 states have (on average 1.0924369747899159) internal successors, (130), 124 states have internal predecessors, (130), 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-08 07:41:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2025-02-08 07:41:14,487 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 107 [2025-02-08 07:41:14,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:14,488 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2025-02-08 07:41:14,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 25 states have internal predecessors, (85), 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-08 07:41:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2025-02-08 07:41:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-08 07:41:14,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:14,489 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] [2025-02-08 07:41:14,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 07:41:14,693 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-08 07:41:14,693 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-08 07:41:14,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:14,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1029687341, now seen corresponding path program 1 times [2025-02-08 07:41:14,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:14,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934438049] [2025-02-08 07:41:14,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:14,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-08 07:41:14,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-08 07:41:14,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:14,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:14,880 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-08 07:41:14,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:14,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934438049] [2025-02-08 07:41:14,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934438049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:41:14,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:41:14,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:41:14,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635681765] [2025-02-08 07:41:14,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:41:14,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:41:14,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:14,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:41:14,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:41:14,881 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-08 07:41:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:14,908 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2025-02-08 07:41:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:41:14,908 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 109 [2025-02-08 07:41:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:14,909 INFO L225 Difference]: With dead ends: 124 [2025-02-08 07:41:14,909 INFO L226 Difference]: Without dead ends: 124 [2025-02-08 07:41:14,909 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-08 07:41:14,909 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 4 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:14,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 175 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:14,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-08 07:41:14,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-08 07:41:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 117 states have (on average 1.0769230769230769) internal successors, (126), 121 states have internal predecessors, (126), 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-08 07:41:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2025-02-08 07:41:14,912 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 109 [2025-02-08 07:41:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:14,912 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2025-02-08 07:41:14,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-08 07:41:14,913 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2025-02-08 07:41:14,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-08 07:41:14,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:14,913 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] [2025-02-08 07:41:14,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 07:41:14,914 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:14,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 339719934, now seen corresponding path program 1 times [2025-02-08 07:41:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313160278] [2025-02-08 07:41:14,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:14,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:14,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 07:41:14,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 07:41:14,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:14,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:15,702 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-08 07:41:15,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:15,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313160278] [2025-02-08 07:41:15,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313160278] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:15,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347794109] [2025-02-08 07:41:15,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:15,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:15,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:15,705 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:15,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 07:41:15,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 07:41:16,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 07:41:16,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:16,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:16,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 07:41:16,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:16,110 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 07:41:16,110 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-08 07:41:16,201 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-02-08 07:41:16,202 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-08 07:41:16,219 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 07:41:16,219 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-08 07:41:16,251 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 07:41:16,251 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-08 07:41:16,278 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-08 07:41:16,813 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-08 07:41:16,968 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-08 07:41:16,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:17,420 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-08 07:41:17,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347794109] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:17,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:17,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 24 [2025-02-08 07:41:17,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765369417] [2025-02-08 07:41:17,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:17,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 07:41:17,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:17,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 07:41:17,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:41:17,423 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 25 states have internal predecessors, (112), 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-08 07:41:17,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:17,452 INFO L93 Difference]: Finished difference Result 122 states and 126 transitions. [2025-02-08 07:41:17,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:41:17,452 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 25 states have internal predecessors, (112), 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 114 [2025-02-08 07:41:17,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:17,453 INFO L225 Difference]: With dead ends: 122 [2025-02-08 07:41:17,453 INFO L226 Difference]: Without dead ends: 122 [2025-02-08 07:41:17,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:41:17,454 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 55 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:17,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 32 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-08 07:41:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-02-08 07:41:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0598290598290598) internal successors, (124), 119 states have internal predecessors, (124), 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-08 07:41:17,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2025-02-08 07:41:17,460 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 114 [2025-02-08 07:41:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:17,460 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2025-02-08 07:41:17,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.666666666666667) internal successors, (112), 25 states have internal predecessors, (112), 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-08 07:41:17,460 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2025-02-08 07:41:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-08 07:41:17,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:17,461 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] [2025-02-08 07:41:17,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:17,661 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-08 07:41:17,662 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:17,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:17,663 INFO L85 PathProgramCache]: Analyzing trace with hash 339719935, now seen corresponding path program 1 times [2025-02-08 07:41:17,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:17,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189838329] [2025-02-08 07:41:17,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:17,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 07:41:17,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 07:41:17,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:17,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:19,336 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-08 07:41:19,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:19,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189838329] [2025-02-08 07:41:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189838329] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:19,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470108623] [2025-02-08 07:41:19,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:19,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:19,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:19,339 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:19,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 07:41:19,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-08 07:41:19,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-08 07:41:19,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:19,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:19,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 1667 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 07:41:19,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:19,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:19,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 07:41:19,844 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 07:41:19,844 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-08 07:41:20,125 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 07:41:20,125 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-08 07:41:20,135 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:41:20,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:41:20,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:20,144 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-02-08 07:41:20,144 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 1 [2025-02-08 07:41:20,219 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 07:41:20,220 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-08 07:41:20,260 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-08 07:41:20,267 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-08 07:41:20,567 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 21 treesize of output 13 [2025-02-08 07:41:20,574 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 15 treesize of output 7 [2025-02-08 07:41:21,119 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-02-08 07:41:21,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470108623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:21,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:41:21,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 27 [2025-02-08 07:41:21,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390156784] [2025-02-08 07:41:21,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:21,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 07:41:21,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:21,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 07:41:21,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 07:41:21,897 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand has 28 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 27 states have internal predecessors, (89), 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-08 07:41:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:22,662 INFO L93 Difference]: Finished difference Result 243 states and 250 transitions. [2025-02-08 07:41:22,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 07:41:22,662 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 27 states have internal predecessors, (89), 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 114 [2025-02-08 07:41:22,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:22,663 INFO L225 Difference]: With dead ends: 243 [2025-02-08 07:41:22,663 INFO L226 Difference]: Without dead ends: 243 [2025-02-08 07:41:22,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=771, Invalid=2199, Unknown=0, NotChecked=0, Total=2970 [2025-02-08 07:41:22,664 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 476 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:22,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 289 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 07:41:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-08 07:41:22,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 123. [2025-02-08 07:41:22,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 119 states have (on average 1.050420168067227) internal successors, (125), 120 states have internal predecessors, (125), 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-08 07:41:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2025-02-08 07:41:22,668 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 114 [2025-02-08 07:41:22,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:22,669 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2025-02-08 07:41:22,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.2962962962962963) internal successors, (89), 27 states have internal predecessors, (89), 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-08 07:41:22,669 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2025-02-08 07:41:22,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-08 07:41:22,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:22,670 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] [2025-02-08 07:41:22,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 07:41:22,870 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,SelfDestructingSolverStorable26 [2025-02-08 07:41:22,871 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:22,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:22,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1653618446, now seen corresponding path program 1 times [2025-02-08 07:41:22,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:22,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190235858] [2025-02-08 07:41:22,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:22,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:22,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 07:41:22,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 07:41:22,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:22,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:24,148 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-08 07:41:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190235858] [2025-02-08 07:41:24,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190235858] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:24,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30079407] [2025-02-08 07:41:24,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:24,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:24,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:24,154 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:24,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 07:41:24,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-08 07:41:24,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-08 07:41:24,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:24,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:24,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 1688 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-08 07:41:24,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:24,580 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 07:41:24,581 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-08 07:41:24,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 07:41:24,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:24,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:24,815 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-08 07:41:24,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:24,827 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 07:41:24,828 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-08 07:41:24,904 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 07:41:24,904 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-08 07:41:24,945 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-08 07:41:25,452 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 23 treesize of output 15 [2025-02-08 07:41:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-02-08 07:41:25,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30079407] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:26,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:41:26,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 26 [2025-02-08 07:41:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876379460] [2025-02-08 07:41:26,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:26,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 07:41:26,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:26,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 07:41:26,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=958, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 07:41:26,515 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 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-08 07:41:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:27,122 INFO L93 Difference]: Finished difference Result 246 states and 253 transitions. [2025-02-08 07:41:27,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:41:27,122 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 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 117 [2025-02-08 07:41:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:27,123 INFO L225 Difference]: With dead ends: 246 [2025-02-08 07:41:27,123 INFO L226 Difference]: Without dead ends: 246 [2025-02-08 07:41:27,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=663, Invalid=1787, Unknown=0, NotChecked=0, Total=2450 [2025-02-08 07:41:27,124 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 312 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:27,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 241 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-08 07:41:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 126. [2025-02-08 07:41:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 122 states have (on average 1.0491803278688525) internal successors, (128), 123 states have internal predecessors, (128), 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-08 07:41:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2025-02-08 07:41:27,128 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 117 [2025-02-08 07:41:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:27,128 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2025-02-08 07:41:27,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 26 states have internal predecessors, (92), 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-08 07:41:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2025-02-08 07:41:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-08 07:41:27,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:27,128 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:27,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:27,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 07:41:27,329 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:27,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:27,329 INFO L85 PathProgramCache]: Analyzing trace with hash -327776097, now seen corresponding path program 2 times [2025-02-08 07:41:27,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:27,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560589049] [2025-02-08 07:41:27,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:27,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-02-08 07:41:27,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 07:41:27,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:41:27,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560589049] [2025-02-08 07:41:29,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560589049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485384025] [2025-02-08 07:41:29,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:29,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:29,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:29,165 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:29,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 07:41:29,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-02-08 07:41:29,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-02-08 07:41:29,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:41:29,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:29,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 1709 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 07:41:29,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:29,583 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 07:41:29,583 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-08 07:41:29,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 07:41:29,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:29,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:29,775 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-08 07:41:29,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:29,793 INFO L349 Elim1Store]: treesize reduction 40, result has 25.9 percent of original size [2025-02-08 07:41:29,794 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-08 07:41:29,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:29,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 07:41:30,164 INFO L134 CoverageAnalysis]: Checked inductivity of 388 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-08 07:41:30,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:30,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485384025] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:30,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:41:30,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 6] total 22 [2025-02-08 07:41:30,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823960147] [2025-02-08 07:41:30,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:30,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 07:41:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:30,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 07:41:30,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2025-02-08 07:41:30,624 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand has 23 states, 22 states have (on average 4.181818181818182) internal successors, (92), 23 states have internal predecessors, (92), 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-08 07:41:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:31,207 INFO L93 Difference]: Finished difference Result 195 states and 200 transitions. [2025-02-08 07:41:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:41:31,208 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.181818181818182) internal successors, (92), 23 states have internal predecessors, (92), 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 120 [2025-02-08 07:41:31,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:31,209 INFO L225 Difference]: With dead ends: 195 [2025-02-08 07:41:31,209 INFO L226 Difference]: Without dead ends: 195 [2025-02-08 07:41:31,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=368, Invalid=1272, Unknown=0, NotChecked=0, Total=1640 [2025-02-08 07:41:31,214 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 347 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:31,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 248 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 07:41:31,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-08 07:41:31,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 135. [2025-02-08 07:41:31,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.0458015267175573) internal successors, (137), 132 states have internal predecessors, (137), 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-08 07:41:31,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2025-02-08 07:41:31,219 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 120 [2025-02-08 07:41:31,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:31,219 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2025-02-08 07:41:31,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.181818181818182) internal successors, (92), 23 states have internal predecessors, (92), 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-08 07:41:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2025-02-08 07:41:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-08 07:41:31,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:31,222 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:31,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 07:41:31,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 07:41:31,423 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-08 07:41:31,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:31,425 INFO L85 PathProgramCache]: Analyzing trace with hash 498041806, now seen corresponding path program 3 times [2025-02-08 07:41:31,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:31,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085182786] [2025-02-08 07:41:31,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:31,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 129 statements into 12 equivalence classes. [2025-02-08 07:41:31,499 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 129 statements. [2025-02-08 07:41:31,499 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 07:41:31,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-02-08 07:41:32,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085182786] [2025-02-08 07:41:32,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085182786] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:32,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313985065] [2025-02-08 07:41:32,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:32,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:32,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:32,023 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:32,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 07:41:32,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 129 statements into 12 equivalence classes. [2025-02-08 07:41:32,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 40 of 129 statements. [2025-02-08 07:41:32,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 07:41:32,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:32,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-08 07:41:32,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:32,416 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 07:41:32,416 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-08 07:41:32,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 07:41:32,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:32,628 INFO L349 Elim1Store]: treesize reduction 42, result has 25.0 percent of original size [2025-02-08 07:41:32,628 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 29 treesize of output 23 [2025-02-08 07:41:32,632 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-08 07:41:32,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:32,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 07:41:32,645 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2025-02-08 07:41:32,645 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 1 [2025-02-08 07:41:32,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:41:32,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 07:41:32,989 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2025-02-08 07:41:32,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:33,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313985065] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:33,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:41:33,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 17 [2025-02-08 07:41:33,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121026818] [2025-02-08 07:41:33,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:33,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 07:41:33,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:33,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 07:41:33,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-02-08 07:41:33,335 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand has 18 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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-08 07:41:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:33,595 INFO L93 Difference]: Finished difference Result 134 states and 138 transitions. [2025-02-08 07:41:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:41:33,595 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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 129 [2025-02-08 07:41:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:33,596 INFO L225 Difference]: With dead ends: 134 [2025-02-08 07:41:33,596 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 07:41:33,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2025-02-08 07:41:33,596 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 174 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:33,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 166 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 07:41:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2025-02-08 07:41:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 130 states have (on average 1.0384615384615385) internal successors, (135), 130 states have internal predecessors, (135), 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-08 07:41:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2025-02-08 07:41:33,599 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 129 [2025-02-08 07:41:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:33,599 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2025-02-08 07:41:33,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 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-08 07:41:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2025-02-08 07:41:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-08 07:41:33,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:33,600 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:41:33,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 07:41:33,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:33,801 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:33,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:33,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1953352582, now seen corresponding path program 1 times [2025-02-08 07:41:33,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:33,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249628812] [2025-02-08 07:41:33,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:33,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:33,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 07:41:33,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 07:41:33,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:33,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249628812] [2025-02-08 07:41:34,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249628812] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:34,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601674249] [2025-02-08 07:41:34,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:41:34,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:34,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:34,010 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:41:34,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 07:41:34,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 07:41:34,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 07:41:34,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:41:34,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:34,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 1795 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-08 07:41:34,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:34,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:34,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601674249] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:34,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:34,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-02-08 07:41:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507886177] [2025-02-08 07:41:34,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:34,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:41:34,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:34,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:41:34,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:41:34,535 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 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-08 07:41:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:34,573 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2025-02-08 07:41:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:41:34,573 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 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 132 [2025-02-08 07:41:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:34,574 INFO L225 Difference]: With dead ends: 154 [2025-02-08 07:41:34,574 INFO L226 Difference]: Without dead ends: 154 [2025-02-08 07:41:34,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:41:34,574 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:34,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 132 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:41:34,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-08 07:41:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-02-08 07:41:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 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-08 07:41:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2025-02-08 07:41:34,577 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 132 [2025-02-08 07:41:34,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:34,578 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2025-02-08 07:41:34,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 states have internal predecessors, (79), 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-08 07:41:34,578 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2025-02-08 07:41:34,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-08 07:41:34,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:34,579 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2025-02-08 07:41:34,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 07:41:34,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:34,780 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:34,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:34,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1936584169, now seen corresponding path program 2 times [2025-02-08 07:41:34,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:34,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274589349] [2025-02-08 07:41:34,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:34,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:34,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 153 statements into 2 equivalence classes. [2025-02-08 07:41:34,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 07:41:34,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:41:34,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274589349] [2025-02-08 07:41:35,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274589349] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:35,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60675641] [2025-02-08 07:41:35,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 07:41:35,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:35,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:35,222 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-08 07:41:35,224 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-08 07:41:35,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 153 statements into 2 equivalence classes. [2025-02-08 07:41:35,687 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 153 of 153 statements. [2025-02-08 07:41:35,687 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 07:41:35,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:35,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1942 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-08 07:41:35,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:41:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:35,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:41:35,943 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:35,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60675641] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 07:41:35,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 07:41:35,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-02-08 07:41:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775560404] [2025-02-08 07:41:35,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 07:41:35,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 07:41:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:41:35,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 07:41:35,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-02-08 07:41:35,945 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand has 29 states, 29 states have (on average 4.172413793103448) internal successors, (121), 29 states have internal predecessors, (121), 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-08 07:41:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:41:36,021 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2025-02-08 07:41:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 07:41:36,022 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.172413793103448) internal successors, (121), 29 states have internal predecessors, (121), 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 153 [2025-02-08 07:41:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:41:36,023 INFO L225 Difference]: With dead ends: 196 [2025-02-08 07:41:36,023 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 07:41:36,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2025-02-08 07:41:36,024 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 4 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:41:36,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 89 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:41:36,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 07:41:36,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-02-08 07:41:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 193 states have (on average 1.0259067357512954) internal successors, (198), 193 states have internal predecessors, (198), 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-08 07:41:36,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 200 transitions. [2025-02-08 07:41:36,030 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 200 transitions. Word has length 153 [2025-02-08 07:41:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:41:36,032 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 200 transitions. [2025-02-08 07:41:36,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.172413793103448) internal successors, (121), 29 states have internal predecessors, (121), 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-08 07:41:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2025-02-08 07:41:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-08 07:41:36,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:41:36,034 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 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] [2025-02-08 07:41:36,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 07:41:36,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:36,235 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 71 more)] === [2025-02-08 07:41:36,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:41:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash 550452873, now seen corresponding path program 3 times [2025-02-08 07:41:36,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:41:36,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293592283] [2025-02-08 07:41:36,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:36,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:41:36,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 195 statements into 27 equivalence classes. [2025-02-08 07:41:38,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) and asserted 195 of 195 statements. [2025-02-08 07:41:38,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2025-02-08 07:41:38,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:41:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-08 07:41:39,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:41:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293592283] [2025-02-08 07:41:39,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293592283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:41:39,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296239940] [2025-02-08 07:41:39,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 07:41:39,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:41:39,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:41:39,390 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-08 07:41:39,392 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-08 07:41:39,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 195 statements into 27 equivalence classes.