./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-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 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:02:32,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:02:32,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-06 12:02:32,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:02:32,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:02:32,403 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:02:32,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:02:32,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:02:32,404 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:02:32,404 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:02:32,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:02:32,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:02:32,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:02:32,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:02:32,404 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:02:32,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:02:32,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:02:32,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:02:32,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:02:32,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:02:32,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:02:32,407 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 -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2025-02-06 12:02:32,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:02:32,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:02:32,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:02:32,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:02:32,618 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:02:32,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-02-06 12:02:33,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0e21f98b/d6eb93517518417f90a925796d15240f/FLAGa703f8040 [2025-02-06 12:02:34,163 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:02:34,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-02-06 12:02:34,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0e21f98b/d6eb93517518417f90a925796d15240f/FLAGa703f8040 [2025-02-06 12:02:34,380 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e0e21f98b/d6eb93517518417f90a925796d15240f [2025-02-06 12:02:34,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:02:34,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:02:34,388 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:02:34,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:02:34,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:02:34,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:02:34" (1/1) ... [2025-02-06 12:02:34,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4238d22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:34, skipping insertion in model container [2025-02-06 12:02:34,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:02:34" (1/1) ... [2025-02-06 12:02:34,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:02:34,712 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,726 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,728 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,730 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,732 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,736 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,736 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,736 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,737 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,739 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,751 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:02:34,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:02:34,798 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:02:34,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:02:35,082 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:02:35,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35 WrapperNode [2025-02-06 12:02:35,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:02:35,085 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:02:35,085 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:02:35,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:02:35,090 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,152 INFO L138 Inliner]: procedures = 346, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 726 [2025-02-06 12:02:35,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:02:35,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:02:35,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:02:35,153 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:02:35,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,198 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 355, 2, 12, 1, 12, 2]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 355, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 5, 0, 2, 1]. [2025-02-06 12:02:35,203 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,242 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:02:35,270 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:02:35,270 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:02:35,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:02:35,271 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (1/1) ... [2025-02-06 12:02:35,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:02:35,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:35,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:02:35,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:02:35,311 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 12:02:35,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 12:02:35,312 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-06 12:02:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:02:35,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:02:35,587 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:02:35,588 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:02:36,167 INFO L? ?]: Removed 257 outVars from TransFormulas that were not future-live. [2025-02-06 12:02:36,167 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:02:36,175 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:02:36,175 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:02:36,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:02:36 BoogieIcfgContainer [2025-02-06 12:02:36,176 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:02:36,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:02:36,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:02:36,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:02:36,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:02:34" (1/3) ... [2025-02-06 12:02:36,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1490f02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:02:36, skipping insertion in model container [2025-02-06 12:02:36,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:02:35" (2/3) ... [2025-02-06 12:02:36,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1490f02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:02:36, skipping insertion in model container [2025-02-06 12:02:36,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:02:36" (3/3) ... [2025-02-06 12:02:36,184 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-1.i [2025-02-06 12:02:36,194 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:02:36,195 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-1.i that has 2 procedures, 242 locations, 1 initial locations, 7 loop locations, and 94 error locations. [2025-02-06 12:02:36,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:02:36,234 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;@8e81964, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:02:36,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-02-06 12:02:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 144 states have (on average 1.9166666666666667) internal successors, (276), 238 states have internal predecessors, (276), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:36,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:02:36,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:36,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:02:36,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:36,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:36,244 INFO L85 PathProgramCache]: Analyzing trace with hash 326664, now seen corresponding path program 1 times [2025-02-06 12:02:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989493298] [2025-02-06 12:02:36,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:36,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:02:36,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:02:36,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:36,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:36,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:36,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989493298] [2025-02-06 12:02:36,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989493298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:36,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:36,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833590330] [2025-02-06 12:02:36,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:36,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:36,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:36,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:36,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:36,905 INFO L87 Difference]: Start difference. First operand has 242 states, 144 states have (on average 1.9166666666666667) internal successors, (276), 238 states have internal predecessors, (276), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:37,146 INFO L93 Difference]: Finished difference Result 251 states and 283 transitions. [2025-02-06 12:02:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:37,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:02:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:37,174 INFO L225 Difference]: With dead ends: 251 [2025-02-06 12:02:37,174 INFO L226 Difference]: Without dead ends: 249 [2025-02-06 12:02:37,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:37,177 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 235 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:37,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 201 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-06 12:02:37,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2025-02-06 12:02:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 140 states have (on average 1.8571428571428572) internal successors, (260), 229 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 264 transitions. [2025-02-06 12:02:37,218 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 264 transitions. Word has length 3 [2025-02-06 12:02:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:37,218 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 264 transitions. [2025-02-06 12:02:37,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 264 transitions. [2025-02-06 12:02:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:02:37,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:37,218 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:02:37,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 12:02:37,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:37,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash 326665, now seen corresponding path program 1 times [2025-02-06 12:02:37,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:37,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261102919] [2025-02-06 12:02:37,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:37,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:37,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:02:37,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:02:37,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:37,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:37,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:37,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261102919] [2025-02-06 12:02:37,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261102919] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:37,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843830335] [2025-02-06 12:02:37,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:37,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:37,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:37,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:37,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:37,466 INFO L87 Difference]: Start difference. First operand 233 states and 264 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:37,599 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2025-02-06 12:02:37,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:37,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:02:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:37,601 INFO L225 Difference]: With dead ends: 232 [2025-02-06 12:02:37,601 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 12:02:37,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:37,602 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 6 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:37,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 427 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:37,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 12:02:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-06 12:02:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 140 states have (on average 1.85) internal successors, (259), 228 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 263 transitions. [2025-02-06 12:02:37,614 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 263 transitions. Word has length 3 [2025-02-06 12:02:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:37,614 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 263 transitions. [2025-02-06 12:02:37,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 263 transitions. [2025-02-06 12:02:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:02:37,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:37,615 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:02:37,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 12:02:37,615 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:37,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1141974750, now seen corresponding path program 1 times [2025-02-06 12:02:37,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:37,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336977687] [2025-02-06 12:02:37,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:37,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:37,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:02:37,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:02:37,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:37,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:38,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336977687] [2025-02-06 12:02:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336977687] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:38,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:38,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:38,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196331089] [2025-02-06 12:02:38,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:38,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:02:38,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:38,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:02:38,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:02:38,113 INFO L87 Difference]: Start difference. First operand 232 states and 263 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:38,258 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2025-02-06 12:02:38,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:02:38,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 12:02:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:38,260 INFO L225 Difference]: With dead ends: 235 [2025-02-06 12:02:38,260 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 12:02:38,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:02:38,261 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 7 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:38,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 425 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 12:02:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2025-02-06 12:02:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 230 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-02-06 12:02:38,270 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 6 [2025-02-06 12:02:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:38,270 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-02-06 12:02:38,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-02-06 12:02:38,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:02:38,270 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:38,271 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:38,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 12:02:38,271 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:38,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:38,271 INFO L85 PathProgramCache]: Analyzing trace with hash 134053156, now seen corresponding path program 1 times [2025-02-06 12:02:38,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:38,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494257358] [2025-02-06 12:02:38,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:38,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:38,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:02:38,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:02:38,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:38,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:38,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:38,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494257358] [2025-02-06 12:02:38,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494257358] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:38,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888562520] [2025-02-06 12:02:38,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:38,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:38,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:38,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:02:38,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:02:38,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:02:38,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:02:38,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:38,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:38,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 12:02:38,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:38,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:38,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-06 12:02:38,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:38,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888562520] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:38,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:38,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2025-02-06 12:02:38,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875275636] [2025-02-06 12:02:38,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:38,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:02:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:38,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:02:38,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:02:38,892 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:39,232 INFO L93 Difference]: Finished difference Result 237 states and 269 transitions. [2025-02-06 12:02:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:02:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:02:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:39,233 INFO L225 Difference]: With dead ends: 237 [2025-02-06 12:02:39,233 INFO L226 Difference]: Without dead ends: 237 [2025-02-06 12:02:39,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2025-02-06 12:02:39,234 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 754 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:39,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 927 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:02:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-06 12:02:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2025-02-06 12:02:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 144 states have (on average 1.8125) internal successors, (261), 230 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-02-06 12:02:39,248 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 9 [2025-02-06 12:02:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:39,248 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-02-06 12:02:39,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:02:39,248 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-02-06 12:02:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 12:02:39,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:39,250 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:39,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:02:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:39,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash -785263400, now seen corresponding path program 1 times [2025-02-06 12:02:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:39,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887624502] [2025-02-06 12:02:39,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:39,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:02:39,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:02:39,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:39,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:39,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:39,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887624502] [2025-02-06 12:02:39,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887624502] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:39,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691683691] [2025-02-06 12:02:39,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:39,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:39,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:39,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:02:39,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:02:39,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 12:02:40,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 12:02:40,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:40,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:40,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:02:40,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:40,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:40,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691683691] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:40,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:40,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-06 12:02:40,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227250139] [2025-02-06 12:02:40,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:40,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:02:40,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:40,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:02:40,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:02:40,164 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:40,201 INFO L93 Difference]: Finished difference Result 246 states and 277 transitions. [2025-02-06 12:02:40,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:02:40,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 18 [2025-02-06 12:02:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:40,202 INFO L225 Difference]: With dead ends: 246 [2025-02-06 12:02:40,202 INFO L226 Difference]: Without dead ends: 246 [2025-02-06 12:02:40,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:02:40,203 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:40,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1023 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-06 12:02:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2025-02-06 12:02:40,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 156 states have (on average 1.75) internal successors, (273), 242 states have internal predecessors, (273), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 277 transitions. [2025-02-06 12:02:40,215 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 277 transitions. Word has length 18 [2025-02-06 12:02:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:40,215 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 277 transitions. [2025-02-06 12:02:40,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 277 transitions. [2025-02-06 12:02:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:02:40,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:40,218 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:40,226 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-06 12:02:40,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:40,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:40,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash -615478952, now seen corresponding path program 2 times [2025-02-06 12:02:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:40,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013903618] [2025-02-06 12:02:40,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:40,455 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-06 12:02:40,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 30 statements. [2025-02-06 12:02:40,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:02:40,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-06 12:02:40,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:40,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013903618] [2025-02-06 12:02:40,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013903618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:40,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:40,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:40,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470914903] [2025-02-06 12:02:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:40,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:40,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:40,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:40,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:40,665 INFO L87 Difference]: Start difference. First operand 246 states and 277 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:40,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:40,798 INFO L93 Difference]: Finished difference Result 257 states and 289 transitions. [2025-02-06 12:02:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:40,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-02-06 12:02:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:40,800 INFO L225 Difference]: With dead ends: 257 [2025-02-06 12:02:40,800 INFO L226 Difference]: Without dead ends: 257 [2025-02-06 12:02:40,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:40,801 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 219 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:40,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 200 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-02-06 12:02:40,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 241. [2025-02-06 12:02:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 156 states have (on average 1.7179487179487178) internal successors, (268), 237 states have internal predecessors, (268), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:40,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2025-02-06 12:02:40,808 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 30 [2025-02-06 12:02:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:40,809 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2025-02-06 12:02:40,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2025-02-06 12:02:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 12:02:40,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:40,810 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:40,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 12:02:40,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:40,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash -615478951, now seen corresponding path program 1 times [2025-02-06 12:02:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:40,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105840022] [2025-02-06 12:02:40,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:40,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:02:40,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:02:40,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:40,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:41,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105840022] [2025-02-06 12:02:41,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105840022] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:41,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299678601] [2025-02-06 12:02:41,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:41,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:41,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:41,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:02:41,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:02:41,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 12:02:41,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 12:02:41,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:41,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:41,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 12:02:41,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:41,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:02:41,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299678601] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:41,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:41,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-02-06 12:02:41,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176412303] [2025-02-06 12:02:41,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:41,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:02:41,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:41,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:02:41,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:41,480 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:41,541 INFO L93 Difference]: Finished difference Result 253 states and 284 transitions. [2025-02-06 12:02:41,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:41,541 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-02-06 12:02:41,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:41,542 INFO L225 Difference]: With dead ends: 253 [2025-02-06 12:02:41,542 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 12:02:41,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:41,543 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 2 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:41,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2003 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 12:02:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-02-06 12:02:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 168 states have (on average 1.6666666666666667) internal successors, (280), 249 states have internal predecessors, (280), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2025-02-06 12:02:41,550 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 30 [2025-02-06 12:02:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:41,550 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2025-02-06 12:02:41,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2025-02-06 12:02:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 12:02:41,551 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:41,551 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:41,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:02:41,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:41,752 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:41,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:41,752 INFO L85 PathProgramCache]: Analyzing trace with hash 176455129, now seen corresponding path program 2 times [2025-02-06 12:02:41,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:41,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746661884] [2025-02-06 12:02:41,753 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:41,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:41,781 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 12:02:41,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-02-06 12:02:41,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:02:41,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:42,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:42,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746661884] [2025-02-06 12:02:42,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746661884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:42,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:42,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:42,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66732163] [2025-02-06 12:02:42,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:42,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:42,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:42,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:42,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:42,273 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:42,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:42,554 INFO L93 Difference]: Finished difference Result 416 states and 477 transitions. [2025-02-06 12:02:42,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:02:42,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-02-06 12:02:42,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:42,556 INFO L225 Difference]: With dead ends: 416 [2025-02-06 12:02:42,556 INFO L226 Difference]: Without dead ends: 416 [2025-02-06 12:02:42,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:42,558 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 602 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:42,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 758 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:02:42,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-02-06 12:02:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 252. [2025-02-06 12:02:42,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 168 states have (on average 1.6607142857142858) internal successors, (279), 248 states have internal predecessors, (279), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2025-02-06 12:02:42,569 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 42 [2025-02-06 12:02:42,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:42,571 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2025-02-06 12:02:42,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2025-02-06 12:02:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 12:02:42,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:42,573 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:42,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 12:02:42,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:42,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:42,574 INFO L85 PathProgramCache]: Analyzing trace with hash -265001854, now seen corresponding path program 1 times [2025-02-06 12:02:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:42,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982604160] [2025-02-06 12:02:42,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:42,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 12:02:42,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 12:02:42,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:42,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982604160] [2025-02-06 12:02:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982604160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:02:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7355707] [2025-02-06 12:02:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:42,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:02:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:42,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:02:42,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:42,954 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:43,239 INFO L93 Difference]: Finished difference Result 280 states and 315 transitions. [2025-02-06 12:02:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:43,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-02-06 12:02:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:43,240 INFO L225 Difference]: With dead ends: 280 [2025-02-06 12:02:43,240 INFO L226 Difference]: Without dead ends: 280 [2025-02-06 12:02:43,241 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-06 12:02:43,241 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 287 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:43,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 381 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:02:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-02-06 12:02:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 265. [2025-02-06 12:02:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 182 states have (on average 1.6483516483516483) internal successors, (300), 261 states have internal predecessors, (300), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 304 transitions. [2025-02-06 12:02:43,247 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 304 transitions. Word has length 45 [2025-02-06 12:02:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:43,247 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 304 transitions. [2025-02-06 12:02:43,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 304 transitions. [2025-02-06 12:02:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 12:02:43,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:43,254 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:43,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 12:02:43,254 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:43,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:43,256 INFO L85 PathProgramCache]: Analyzing trace with hash -265002783, now seen corresponding path program 1 times [2025-02-06 12:02:43,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:43,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602182198] [2025-02-06 12:02:43,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:43,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 12:02:43,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 12:02:43,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:43,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:43,415 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:43,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602182198] [2025-02-06 12:02:43,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602182198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:43,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:43,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:43,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580464774] [2025-02-06 12:02:43,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:43,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:02:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:43,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:02:43,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:02:43,417 INFO L87 Difference]: Start difference. First operand 265 states and 304 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:43,559 INFO L93 Difference]: Finished difference Result 296 states and 342 transitions. [2025-02-06 12:02:43,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:02:43,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-02-06 12:02:43,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:43,561 INFO L225 Difference]: With dead ends: 296 [2025-02-06 12:02:43,562 INFO L226 Difference]: Without dead ends: 296 [2025-02-06 12:02:43,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:43,563 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 375 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:43,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 266 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-06 12:02:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 258. [2025-02-06 12:02:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 182 states have (on average 1.60989010989011) internal successors, (293), 254 states have internal predecessors, (293), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 297 transitions. [2025-02-06 12:02:43,571 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 297 transitions. Word has length 45 [2025-02-06 12:02:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:43,572 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 297 transitions. [2025-02-06 12:02:43,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 297 transitions. [2025-02-06 12:02:43,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 12:02:43,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:43,573 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:43,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 12:02:43,573 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:43,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash -265002782, now seen corresponding path program 1 times [2025-02-06 12:02:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:43,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900300765] [2025-02-06 12:02:43,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:43,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:43,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 12:02:43,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 12:02:43,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:43,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:43,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:43,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900300765] [2025-02-06 12:02:43,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900300765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:43,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:43,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:43,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991599826] [2025-02-06 12:02:43,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:43,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:02:43,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:43,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:02:43,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:43,790 INFO L87 Difference]: Start difference. First operand 258 states and 297 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:43,848 INFO L93 Difference]: Finished difference Result 263 states and 296 transitions. [2025-02-06 12:02:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:43,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2025-02-06 12:02:43,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:43,849 INFO L225 Difference]: With dead ends: 263 [2025-02-06 12:02:43,849 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 12:02:43,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:43,850 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 232 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:43,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 937 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:43,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 12:02:43,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 258. [2025-02-06 12:02:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 182 states have (on average 1.6043956043956045) internal successors, (292), 254 states have internal predecessors, (292), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:43,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 296 transitions. [2025-02-06 12:02:43,854 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 296 transitions. Word has length 45 [2025-02-06 12:02:43,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:43,855 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 296 transitions. [2025-02-06 12:02:43,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:43,855 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 296 transitions. [2025-02-06 12:02:43,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 12:02:43,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:43,855 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 12:02:43,855 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:43,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash -520127085, now seen corresponding path program 1 times [2025-02-06 12:02:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275432168] [2025-02-06 12:02:43,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:43,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 12:02:43,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 12:02:43,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:43,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:44,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275432168] [2025-02-06 12:02:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275432168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:44,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:44,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:02:44,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240717415] [2025-02-06 12:02:44,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:44,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:44,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:44,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:44,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:44,144 INFO L87 Difference]: Start difference. First operand 258 states and 296 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:44,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:44,235 INFO L93 Difference]: Finished difference Result 263 states and 303 transitions. [2025-02-06 12:02:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:44,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-06 12:02:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:44,236 INFO L225 Difference]: With dead ends: 263 [2025-02-06 12:02:44,236 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 12:02:44,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:44,237 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 205 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:44,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 196 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 12:02:44,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2025-02-06 12:02:44,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 187 states have (on average 1.5989304812834224) internal successors, (299), 258 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 303 transitions. [2025-02-06 12:02:44,245 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 303 transitions. Word has length 48 [2025-02-06 12:02:44,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:44,246 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 303 transitions. [2025-02-06 12:02:44,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 303 transitions. [2025-02-06 12:02:44,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-06 12:02:44,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:44,246 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:44,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 12:02:44,247 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:44,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:44,247 INFO L85 PathProgramCache]: Analyzing trace with hash -520127084, now seen corresponding path program 1 times [2025-02-06 12:02:44,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:44,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403994587] [2025-02-06 12:02:44,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:44,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:44,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 12:02:44,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 12:02:44,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:44,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:44,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:44,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403994587] [2025-02-06 12:02:44,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403994587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:44,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:44,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:44,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422274620] [2025-02-06 12:02:44,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:44,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:44,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:44,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:44,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:44,794 INFO L87 Difference]: Start difference. First operand 262 states and 303 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:45,187 INFO L93 Difference]: Finished difference Result 266 states and 302 transitions. [2025-02-06 12:02:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:02:45,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2025-02-06 12:02:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:45,188 INFO L225 Difference]: With dead ends: 266 [2025-02-06 12:02:45,189 INFO L226 Difference]: Without dead ends: 266 [2025-02-06 12:02:45,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:02:45,189 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 16 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:45,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 773 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:02:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-06 12:02:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 262. [2025-02-06 12:02:45,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 187 states have (on average 1.5935828877005347) internal successors, (298), 258 states have internal predecessors, (298), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 302 transitions. [2025-02-06 12:02:45,196 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 302 transitions. Word has length 48 [2025-02-06 12:02:45,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:45,197 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 302 transitions. [2025-02-06 12:02:45,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 302 transitions. [2025-02-06 12:02:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 12:02:45,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:45,198 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:45,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 12:02:45,199 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:45,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:45,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1136252954, now seen corresponding path program 1 times [2025-02-06 12:02:45,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:45,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285342353] [2025-02-06 12:02:45,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:45,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:02:45,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:02:45,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:45,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:45,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285342353] [2025-02-06 12:02:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285342353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:45,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:45,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619442943] [2025-02-06 12:02:45,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:45,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:45,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:45,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:45,480 INFO L87 Difference]: Start difference. First operand 262 states and 302 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:45,661 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2025-02-06 12:02:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:45,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-02-06 12:02:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:45,664 INFO L225 Difference]: With dead ends: 261 [2025-02-06 12:02:45,664 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 12:02:45,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:45,664 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 12 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:45,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 704 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 12:02:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-02-06 12:02:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 187 states have (on average 1.5828877005347595) internal successors, (296), 257 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 300 transitions. [2025-02-06 12:02:45,670 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 300 transitions. Word has length 51 [2025-02-06 12:02:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:45,670 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 300 transitions. [2025-02-06 12:02:45,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 300 transitions. [2025-02-06 12:02:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-06 12:02:45,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:45,671 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:45,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 12:02:45,672 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:45,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1136252955, now seen corresponding path program 1 times [2025-02-06 12:02:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:45,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298344745] [2025-02-06 12:02:45,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:45,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:45,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 12:02:45,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 12:02:45,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:45,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:46,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:46,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298344745] [2025-02-06 12:02:46,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298344745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:46,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:46,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:46,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612412075] [2025-02-06 12:02:46,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:46,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:46,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:46,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:46,090 INFO L87 Difference]: Start difference. First operand 261 states and 300 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:46,273 INFO L93 Difference]: Finished difference Result 260 states and 298 transitions. [2025-02-06 12:02:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:46,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2025-02-06 12:02:46,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:46,274 INFO L225 Difference]: With dead ends: 260 [2025-02-06 12:02:46,275 INFO L226 Difference]: Without dead ends: 260 [2025-02-06 12:02:46,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:46,275 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 11 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:46,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 706 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:02:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-06 12:02:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2025-02-06 12:02:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 187 states have (on average 1.572192513368984) internal successors, (294), 256 states have internal predecessors, (294), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 298 transitions. [2025-02-06 12:02:46,284 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 298 transitions. Word has length 51 [2025-02-06 12:02:46,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:46,285 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 298 transitions. [2025-02-06 12:02:46,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,285 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 298 transitions. [2025-02-06 12:02:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-06 12:02:46,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:46,285 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:46,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 12:02:46,285 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:46,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:46,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1528198642, now seen corresponding path program 1 times [2025-02-06 12:02:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583331578] [2025-02-06 12:02:46,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:46,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:46,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 12:02:46,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 12:02:46,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:46,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:46,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583331578] [2025-02-06 12:02:46,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583331578] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:46,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:46,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:02:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981344533] [2025-02-06 12:02:46,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:46,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:02:46,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:46,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:02:46,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:46,399 INFO L87 Difference]: Start difference. First operand 260 states and 298 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:46,411 INFO L93 Difference]: Finished difference Result 272 states and 313 transitions. [2025-02-06 12:02:46,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:02:46,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2025-02-06 12:02:46,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:46,412 INFO L225 Difference]: With dead ends: 272 [2025-02-06 12:02:46,412 INFO L226 Difference]: Without dead ends: 272 [2025-02-06 12:02:46,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:02:46,413 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 6 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:46,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 477 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:46,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-02-06 12:02:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 262. [2025-02-06 12:02:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 189 states have (on average 1.566137566137566) internal successors, (296), 258 states have internal predecessors, (296), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 300 transitions. [2025-02-06 12:02:46,418 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 300 transitions. Word has length 55 [2025-02-06 12:02:46,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:46,418 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 300 transitions. [2025-02-06 12:02:46,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,418 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 300 transitions. [2025-02-06 12:02:46,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 12:02:46,418 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:46,418 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:46,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 12:02:46,419 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:46,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:46,419 INFO L85 PathProgramCache]: Analyzing trace with hash -129271095, now seen corresponding path program 1 times [2025-02-06 12:02:46,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:46,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744687960] [2025-02-06 12:02:46,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:46,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:46,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 12:02:46,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 12:02:46,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:46,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:46,555 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:46,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:46,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744687960] [2025-02-06 12:02:46,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744687960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:02:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808271234] [2025-02-06 12:02:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:46,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 12:02:46,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:46,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 12:02:46,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 12:02:46,557 INFO L87 Difference]: Start difference. First operand 262 states and 300 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:46,696 INFO L93 Difference]: Finished difference Result 261 states and 298 transitions. [2025-02-06 12:02:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 12:02:46,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-02-06 12:02:46,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:46,698 INFO L225 Difference]: With dead ends: 261 [2025-02-06 12:02:46,698 INFO L226 Difference]: Without dead ends: 261 [2025-02-06 12:02:46,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:02:46,698 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 5 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:46,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 763 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:02:46,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-06 12:02:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2025-02-06 12:02:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 189 states have (on average 1.5555555555555556) internal successors, (294), 257 states have internal predecessors, (294), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 298 transitions. [2025-02-06 12:02:46,703 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 298 transitions. Word has length 56 [2025-02-06 12:02:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:46,703 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 298 transitions. [2025-02-06 12:02:46,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 298 transitions. [2025-02-06 12:02:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-06 12:02:46,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:46,704 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:46,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 12:02:46,704 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:46,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash -129271094, now seen corresponding path program 1 times [2025-02-06 12:02:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186432328] [2025-02-06 12:02:46,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:46,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:46,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 12:02:46,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 12:02:46,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:46,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:47,220 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:47,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:47,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186432328] [2025-02-06 12:02:47,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186432328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:02:47,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:02:47,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 12:02:47,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854572544] [2025-02-06 12:02:47,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:02:47,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:47,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:47,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:47,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:47,222 INFO L87 Difference]: Start difference. First operand 261 states and 298 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:47,507 INFO L93 Difference]: Finished difference Result 269 states and 307 transitions. [2025-02-06 12:02:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:02:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2025-02-06 12:02:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:47,508 INFO L225 Difference]: With dead ends: 269 [2025-02-06 12:02:47,508 INFO L226 Difference]: Without dead ends: 269 [2025-02-06 12:02:47,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:02:47,508 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 11 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:47,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1003 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 12:02:47,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-02-06 12:02:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2025-02-06 12:02:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 195 states have (on average 1.5435897435897437) internal successors, (301), 263 states have internal predecessors, (301), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:47,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 305 transitions. [2025-02-06 12:02:47,514 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 305 transitions. Word has length 56 [2025-02-06 12:02:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:47,514 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 305 transitions. [2025-02-06 12:02:47,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 305 transitions. [2025-02-06 12:02:47,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 12:02:47,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:47,515 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:47,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 12:02:47,515 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:47,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:47,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1653070362, now seen corresponding path program 1 times [2025-02-06 12:02:47,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:47,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341353694] [2025-02-06 12:02:47,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:47,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:47,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 12:02:47,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 12:02:47,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:47,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:47,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341353694] [2025-02-06 12:02:47,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341353694] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:47,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216959815] [2025-02-06 12:02:47,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:47,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:47,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:47,638 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:02:47,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:02:47,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 12:02:47,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 12:02:47,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:47,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:47,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:02:47,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:47,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:47,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216959815] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:47,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:47,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 12:02:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662653076] [2025-02-06 12:02:47,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:47,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:02:47,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:47,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:02:47,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:47,954 INFO L87 Difference]: Start difference. First operand 267 states and 305 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:47,981 INFO L93 Difference]: Finished difference Result 294 states and 335 transitions. [2025-02-06 12:02:47,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:02:47,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2025-02-06 12:02:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:47,982 INFO L225 Difference]: With dead ends: 294 [2025-02-06 12:02:47,982 INFO L226 Difference]: Without dead ends: 294 [2025-02-06 12:02:47,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:02:47,983 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 13 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:47,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 950 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-02-06 12:02:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2025-02-06 12:02:47,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 219 states have (on average 1.5114155251141552) internal successors, (331), 287 states have internal predecessors, (331), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:47,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 335 transitions. [2025-02-06 12:02:47,989 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 335 transitions. Word has length 60 [2025-02-06 12:02:47,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:47,989 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 335 transitions. [2025-02-06 12:02:47,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:47,989 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 335 transitions. [2025-02-06 12:02:47,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-06 12:02:47,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:47,989 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:48,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:48,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:48,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:48,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:48,190 INFO L85 PathProgramCache]: Analyzing trace with hash 294672882, now seen corresponding path program 1 times [2025-02-06 12:02:48,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:48,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86881933] [2025-02-06 12:02:48,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:48,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:48,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 12:02:48,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 12:02:48,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:48,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:48,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86881933] [2025-02-06 12:02:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86881933] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:48,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839228094] [2025-02-06 12:02:48,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:48,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:48,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:48,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:02:48,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:02:48,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-06 12:02:49,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-06 12:02:49,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:49,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:49,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 12:02:49,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:49,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 12:02:49,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:02:49,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-02-06 12:02:49,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 12 [2025-02-06 12:02:49,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2025-02-06 12:02:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:49,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:49,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839228094] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:49,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:49,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-02-06 12:02:49,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933754842] [2025-02-06 12:02:49,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:49,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 12:02:49,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:49,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 12:02:49,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-02-06 12:02:49,542 INFO L87 Difference]: Start difference. First operand 291 states and 335 transitions. Second operand has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:50,256 INFO L93 Difference]: Finished difference Result 290 states and 329 transitions. [2025-02-06 12:02:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:50,257 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2025-02-06 12:02:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:50,258 INFO L225 Difference]: With dead ends: 290 [2025-02-06 12:02:50,258 INFO L226 Difference]: Without dead ends: 290 [2025-02-06 12:02:50,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:02:50,259 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 28 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2105 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:50,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2105 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:02:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-06 12:02:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-02-06 12:02:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 219 states have (on average 1.4840182648401827) internal successors, (325), 286 states have internal predecessors, (325), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 329 transitions. [2025-02-06 12:02:50,265 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 329 transitions. Word has length 61 [2025-02-06 12:02:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:50,265 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 329 transitions. [2025-02-06 12:02:50,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.238095238095238) internal successors, (68), 22 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 329 transitions. [2025-02-06 12:02:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-06 12:02:50,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:50,266 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:50,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:02:50,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:50,470 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:50,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1278994418, now seen corresponding path program 2 times [2025-02-06 12:02:50,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:50,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649168360] [2025-02-06 12:02:50,471 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:50,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:50,501 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-06 12:02:50,571 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 12:02:50,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:02:50,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:50,731 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:50,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:50,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649168360] [2025-02-06 12:02:50,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649168360] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:50,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796061007] [2025-02-06 12:02:50,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:02:50,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:50,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:50,734 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:02:50,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:02:50,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-06 12:02:51,025 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-06 12:02:51,025 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 12:02:51,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:51,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:02:51,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:51,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:02:51,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796061007] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:51,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:51,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-02-06 12:02:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136607588] [2025-02-06 12:02:51,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:51,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 12:02:51,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:51,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 12:02:51,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:51,162 INFO L87 Difference]: Start difference. First operand 290 states and 329 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:51,210 INFO L93 Difference]: Finished difference Result 359 states and 395 transitions. [2025-02-06 12:02:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:51,210 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2025-02-06 12:02:51,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:51,211 INFO L225 Difference]: With dead ends: 359 [2025-02-06 12:02:51,211 INFO L226 Difference]: Without dead ends: 359 [2025-02-06 12:02:51,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 12:02:51,212 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 35 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:51,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 732 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:02:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-02-06 12:02:51,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 350. [2025-02-06 12:02:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 279 states have (on average 1.4014336917562724) internal successors, (391), 346 states have internal predecessors, (391), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:51,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 395 transitions. [2025-02-06 12:02:51,220 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 395 transitions. Word has length 75 [2025-02-06 12:02:51,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:51,220 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 395 transitions. [2025-02-06 12:02:51,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 13 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 395 transitions. [2025-02-06 12:02:51,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 12:02:51,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:51,229 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:51,254 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-06 12:02:51,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-06 12:02:51,430 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:51,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1822929650, now seen corresponding path program 3 times [2025-02-06 12:02:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:51,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732106030] [2025-02-06 12:02:51,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:02:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:51,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-02-06 12:02:51,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-02-06 12:02:51,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 12:02:51,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:51,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:51,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732106030] [2025-02-06 12:02:51,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732106030] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:51,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026320422] [2025-02-06 12:02:51,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 12:02:51,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:51,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:51,986 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:02:51,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:02:52,165 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 12 equivalence classes. [2025-02-06 12:02:52,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 105 statements. [2025-02-06 12:02:52,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 12:02:52,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:52,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1025 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:02:52,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:52,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:02:52,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-02-06 12:02:52,359 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:52,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:02:52,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:02:52,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-02-06 12:02:52,870 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:52,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:02:52,887 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:52,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:53,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:02:53,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2025-02-06 12:02:54,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2025-02-06 12:02:54,157 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-06 12:02:54,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2025-02-06 12:02:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:54,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026320422] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:54,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:54,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2025-02-06 12:02:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511419549] [2025-02-06 12:02:54,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:54,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 12:02:54,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:54,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 12:02:54,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-02-06 12:02:54,200 INFO L87 Difference]: Start difference. First operand 350 states and 395 transitions. Second operand has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:54,938 INFO L93 Difference]: Finished difference Result 353 states and 388 transitions. [2025-02-06 12:02:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:54,938 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-02-06 12:02:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:54,939 INFO L225 Difference]: With dead ends: 353 [2025-02-06 12:02:54,939 INFO L226 Difference]: Without dead ends: 353 [2025-02-06 12:02:54,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:02:54,941 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 837 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:54,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1193 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 12:02:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-02-06 12:02:54,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 291. [2025-02-06 12:02:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 224 states have (on average 1.4375) internal successors, (322), 287 states have internal predecessors, (322), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 326 transitions. [2025-02-06 12:02:54,946 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 326 transitions. Word has length 105 [2025-02-06 12:02:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:54,946 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 326 transitions. [2025-02-06 12:02:54,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3636363636363638) internal successors, (74), 22 states have internal predecessors, (74), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:02:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 326 transitions. [2025-02-06 12:02:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 12:02:54,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:54,947 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:54,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 12:02:55,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:55,180 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:55,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:55,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1822930578, now seen corresponding path program 1 times [2025-02-06 12:02:55,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:55,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647338674] [2025-02-06 12:02:55,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:55,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:55,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 12:02:55,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 12:02:55,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:55,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647338674] [2025-02-06 12:02:55,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647338674] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:55,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796125321] [2025-02-06 12:02:55,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:55,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:55,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:55,672 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:02:55,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:02:55,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 12:02:56,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 12:02:56,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:56,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:56,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 12:02:56,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:56,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:02:56,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 12:02:56,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:56,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:02:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:56,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:02:56,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2025-02-06 12:02:56,462 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-02-06 12:02:56,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-02-06 12:02:56,489 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:56,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796125321] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:02:56,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:02:56,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-02-06 12:02:56,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021646826] [2025-02-06 12:02:56,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:02:56,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 12:02:56,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:02:56,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 12:02:56,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:02:56,490 INFO L87 Difference]: Start difference. First operand 291 states and 326 transitions. Second operand has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:02:57,133 INFO L93 Difference]: Finished difference Result 356 states and 390 transitions. [2025-02-06 12:02:57,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 12:02:57,133 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 105 [2025-02-06 12:02:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:02:57,135 INFO L225 Difference]: With dead ends: 356 [2025-02-06 12:02:57,135 INFO L226 Difference]: Without dead ends: 356 [2025-02-06 12:02:57,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2025-02-06 12:02:57,135 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1149 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:02:57,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 918 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:02:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-02-06 12:02:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 288. [2025-02-06 12:02:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.4241071428571428) internal successors, (319), 284 states have internal predecessors, (319), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:02:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 323 transitions. [2025-02-06 12:02:57,140 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 323 transitions. Word has length 105 [2025-02-06 12:02:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:02:57,142 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 323 transitions. [2025-02-06 12:02:57,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.9444444444444446) internal successors, (71), 19 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:02:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 323 transitions. [2025-02-06 12:02:57,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-06 12:02:57,143 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:02:57,143 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:02:57,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:02:57,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:57,344 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:02:57,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:02:57,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1330497144, now seen corresponding path program 1 times [2025-02-06 12:02:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:02:57,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442342843] [2025-02-06 12:02:57,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:57,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:02:57,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:02:57,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:02:57,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:57,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:58,256 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:02:58,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:02:58,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442342843] [2025-02-06 12:02:58,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442342843] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:02:58,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112882757] [2025-02-06 12:02:58,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:02:58,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:02:58,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:02:58,259 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:02:58,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:02:58,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-06 12:02:58,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-06 12:02:58,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:02:58,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:02:58,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 1529 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 12:02:58,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:02:58,636 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2025-02-06 12:02:58,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 23 [2025-02-06 12:02:58,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2025-02-06 12:02:58,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:02:58,781 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:02:58,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:02:58,806 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-02-06 12:02:58,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2025-02-06 12:02:58,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 12:03:00,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-02-06 12:03:01,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:01,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2025-02-06 12:03:01,133 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 12:03:01,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 12:03:01,222 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-02-06 12:03:01,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:02,071 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 12:03:02,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2025-02-06 12:03:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:02,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112882757] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:02,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:02,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 23 [2025-02-06 12:03:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842144823] [2025-02-06 12:03:02,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:02,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:03:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:02,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:03:02,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-02-06 12:03:02,425 INFO L87 Difference]: Start difference. First operand 288 states and 323 transitions. Second operand has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 24 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:03,564 INFO L93 Difference]: Finished difference Result 476 states and 528 transitions. [2025-02-06 12:03:03,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 12:03:03,564 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 24 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 108 [2025-02-06 12:03:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:03,566 INFO L225 Difference]: With dead ends: 476 [2025-02-06 12:03:03,566 INFO L226 Difference]: Without dead ends: 476 [2025-02-06 12:03:03,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 12:03:03,567 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 625 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:03,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 1046 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 12:03:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-02-06 12:03:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 327. [2025-02-06 12:03:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 263 states have (on average 1.467680608365019) internal successors, (386), 322 states have internal predecessors, (386), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 392 transitions. [2025-02-06 12:03:03,575 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 392 transitions. Word has length 108 [2025-02-06 12:03:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:03,576 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 392 transitions. [2025-02-06 12:03:03,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.739130434782609) internal successors, (86), 24 states have internal predecessors, (86), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 392 transitions. [2025-02-06 12:03:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-06 12:03:03,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:03,577 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-06 12:03:03,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 12:03:03,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:03,782 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:03,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash 846272963, now seen corresponding path program 1 times [2025-02-06 12:03:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:03,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51638518] [2025-02-06 12:03:03,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:03,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-06 12:03:03,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-06 12:03:03,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:04,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:04,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51638518] [2025-02-06 12:03:04,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51638518] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:04,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:04,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:03:04,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005243832] [2025-02-06 12:03:04,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:04,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:03:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:04,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:03:04,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:04,359 INFO L87 Difference]: Start difference. First operand 327 states and 392 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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-06 12:03:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:04,534 INFO L93 Difference]: Finished difference Result 375 states and 451 transitions. [2025-02-06 12:03:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:03:04,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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-06 12:03:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:04,536 INFO L225 Difference]: With dead ends: 375 [2025-02-06 12:03:04,536 INFO L226 Difference]: Without dead ends: 375 [2025-02-06 12:03:04,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:03:04,537 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 363 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:04,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 641 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 12:03:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-02-06 12:03:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 332. [2025-02-06 12:03:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 268 states have (on average 1.462686567164179) internal successors, (392), 327 states have internal predecessors, (392), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 398 transitions. [2025-02-06 12:03:04,547 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 398 transitions. Word has length 109 [2025-02-06 12:03:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:04,547 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 398 transitions. [2025-02-06 12:03:04,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 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-06 12:03:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 398 transitions. [2025-02-06 12:03:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 12:03:04,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:04,548 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:04,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 12:03:04,553 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:04,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1013823103, now seen corresponding path program 1 times [2025-02-06 12:03:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:04,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896652775] [2025-02-06 12:03:04,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:04,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 12:03:04,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 12:03:04,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:04,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896652775] [2025-02-06 12:03:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896652775] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196259668] [2025-02-06 12:03:06,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:06,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:06,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:06,925 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:06,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 12:03:07,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 12:03:07,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 12:03:07,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:07,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:07,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 1527 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 12:03:07,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:07,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 12:03:07,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-02-06 12:03:07,378 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-02-06 12:03:07,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 12:03:07,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:07,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-06 12:03:07,957 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:07,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:08,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196259668] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:08,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:08,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 20 [2025-02-06 12:03:08,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780866922] [2025-02-06 12:03:08,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:08,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 12:03:08,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:08,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 12:03:08,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2025-02-06 12:03:08,874 INFO L87 Difference]: Start difference. First operand 332 states and 398 transitions. Second operand has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:09,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:09,672 INFO L93 Difference]: Finished difference Result 544 states and 665 transitions. [2025-02-06 12:03:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:03:09,674 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2025-02-06 12:03:09,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:09,679 INFO L225 Difference]: With dead ends: 544 [2025-02-06 12:03:09,679 INFO L226 Difference]: Without dead ends: 544 [2025-02-06 12:03:09,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2025-02-06 12:03:09,680 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 952 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:09,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 2611 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 12:03:09,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-02-06 12:03:09,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 394. [2025-02-06 12:03:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 330 states have (on average 1.3818181818181818) internal successors, (456), 389 states have internal predecessors, (456), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:09,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 462 transitions. [2025-02-06 12:03:09,702 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 462 transitions. Word has length 112 [2025-02-06 12:03:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:09,703 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 462 transitions. [2025-02-06 12:03:09,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:09,703 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 462 transitions. [2025-02-06 12:03:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-06 12:03:09,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:09,704 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:09,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 12:03:09,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-06 12:03:09,905 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:09,906 INFO L85 PathProgramCache]: Analyzing trace with hash -140078618, now seen corresponding path program 1 times [2025-02-06 12:03:09,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104609255] [2025-02-06 12:03:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:09,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-06 12:03:09,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-06 12:03:09,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:09,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:10,411 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:10,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:10,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104609255] [2025-02-06 12:03:10,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104609255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:10,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:10,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 12:03:10,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665717959] [2025-02-06 12:03:10,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:10,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 12:03:10,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:10,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 12:03:10,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 12:03:10,414 INFO L87 Difference]: Start difference. First operand 394 states and 462 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:10,500 INFO L93 Difference]: Finished difference Result 443 states and 526 transitions. [2025-02-06 12:03:10,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:03:10,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 112 [2025-02-06 12:03:10,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:10,502 INFO L225 Difference]: With dead ends: 443 [2025-02-06 12:03:10,502 INFO L226 Difference]: Without dead ends: 443 [2025-02-06 12:03:10,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:03:10,502 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 43 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:10,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1294 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:10,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-02-06 12:03:10,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 400. [2025-02-06 12:03:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 336 states have (on average 1.3779761904761905) internal successors, (463), 395 states have internal predecessors, (463), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 469 transitions. [2025-02-06 12:03:10,519 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 469 transitions. Word has length 112 [2025-02-06 12:03:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:10,520 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 469 transitions. [2025-02-06 12:03:10,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:10,520 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 469 transitions. [2025-02-06 12:03:10,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 12:03:10,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:10,522 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:10,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 12:03:10,522 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:10,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:10,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1112042447, now seen corresponding path program 1 times [2025-02-06 12:03:10,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:10,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469733133] [2025-02-06 12:03:10,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:10,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:10,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 12:03:10,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 12:03:10,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:10,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:10,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:10,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469733133] [2025-02-06 12:03:10,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469733133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:10,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:10,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:03:10,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164631932] [2025-02-06 12:03:10,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:10,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:03:10,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:10,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:03:10,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:10,829 INFO L87 Difference]: Start difference. First operand 400 states and 469 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:10,848 INFO L93 Difference]: Finished difference Result 402 states and 471 transitions. [2025-02-06 12:03:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:03:10,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 116 [2025-02-06 12:03:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:10,853 INFO L225 Difference]: With dead ends: 402 [2025-02-06 12:03:10,856 INFO L226 Difference]: Without dead ends: 402 [2025-02-06 12:03:10,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:10,857 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:10,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 685 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-06 12:03:10,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2025-02-06 12:03:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 338 states have (on average 1.3757396449704142) internal successors, (465), 397 states have internal predecessors, (465), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 471 transitions. [2025-02-06 12:03:10,874 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 471 transitions. Word has length 116 [2025-02-06 12:03:10,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:10,874 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 471 transitions. [2025-02-06 12:03:10,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 471 transitions. [2025-02-06 12:03:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 12:03:10,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:10,875 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:10,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 12:03:10,875 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:10,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:10,875 INFO L85 PathProgramCache]: Analyzing trace with hash -113560435, now seen corresponding path program 1 times [2025-02-06 12:03:10,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:10,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153449864] [2025-02-06 12:03:10,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:10,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 12:03:10,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 12:03:10,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:10,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:11,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:11,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153449864] [2025-02-06 12:03:11,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153449864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:11,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:11,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:11,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046968293] [2025-02-06 12:03:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:11,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:11,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:11,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:11,115 INFO L87 Difference]: Start difference. First operand 402 states and 471 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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-06 12:03:11,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:11,212 INFO L93 Difference]: Finished difference Result 401 states and 470 transitions. [2025-02-06 12:03:11,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:11,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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 117 [2025-02-06 12:03:11,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:11,215 INFO L225 Difference]: With dead ends: 401 [2025-02-06 12:03:11,216 INFO L226 Difference]: Without dead ends: 401 [2025-02-06 12:03:11,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:11,217 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:11,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 390 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-02-06 12:03:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2025-02-06 12:03:11,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 338 states have (on average 1.3727810650887573) internal successors, (464), 396 states have internal predecessors, (464), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 470 transitions. [2025-02-06 12:03:11,240 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 470 transitions. Word has length 117 [2025-02-06 12:03:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:11,240 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 470 transitions. [2025-02-06 12:03:11,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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-06 12:03:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 470 transitions. [2025-02-06 12:03:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 12:03:11,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:11,241 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:11,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 12:03:11,241 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:11,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash -113560436, now seen corresponding path program 1 times [2025-02-06 12:03:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:11,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883314519] [2025-02-06 12:03:11,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:11,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 12:03:11,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 12:03:11,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:11,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:11,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883314519] [2025-02-06 12:03:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883314519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:11,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:11,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545462217] [2025-02-06 12:03:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:11,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:11,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:11,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:11,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:11,481 INFO L87 Difference]: Start difference. First operand 401 states and 470 transitions. Second operand has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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-06 12:03:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:11,571 INFO L93 Difference]: Finished difference Result 400 states and 469 transitions. [2025-02-06 12:03:11,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:11,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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 117 [2025-02-06 12:03:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:11,573 INFO L225 Difference]: With dead ends: 400 [2025-02-06 12:03:11,573 INFO L226 Difference]: Without dead ends: 400 [2025-02-06 12:03:11,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:11,573 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 1 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 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-06 12:03:11,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-02-06 12:03:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2025-02-06 12:03:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 338 states have (on average 1.3698224852071006) internal successors, (463), 395 states have internal predecessors, (463), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:11,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 469 transitions. [2025-02-06 12:03:11,578 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 469 transitions. Word has length 117 [2025-02-06 12:03:11,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:11,578 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 469 transitions. [2025-02-06 12:03:11,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 21.5) internal successors, (43), 3 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-06 12:03:11,579 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 469 transitions. [2025-02-06 12:03:11,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-02-06 12:03:11,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:11,579 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:11,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 12:03:11,579 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:11,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:11,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1351619019, now seen corresponding path program 1 times [2025-02-06 12:03:11,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:11,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459761360] [2025-02-06 12:03:11,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:11,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:11,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 12:03:11,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 12:03:11,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:11,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:11,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:11,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459761360] [2025-02-06 12:03:11,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459761360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:11,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:11,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 12:03:11,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202695339] [2025-02-06 12:03:11,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:11,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:03:11,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:11,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:03:11,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:11,752 INFO L87 Difference]: Start difference. First operand 400 states and 469 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:11,773 INFO L93 Difference]: Finished difference Result 399 states and 465 transitions. [2025-02-06 12:03:11,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:03:11,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 120 [2025-02-06 12:03:11,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:11,774 INFO L225 Difference]: With dead ends: 399 [2025-02-06 12:03:11,774 INFO L226 Difference]: Without dead ends: 399 [2025-02-06 12:03:11,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:11,775 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 2 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:11,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 674 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 12:03:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-06 12:03:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2025-02-06 12:03:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 334 states have (on average 1.3622754491017963) internal successors, (455), 391 states have internal predecessors, (455), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:11,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 461 transitions. [2025-02-06 12:03:11,791 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 461 transitions. Word has length 120 [2025-02-06 12:03:11,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:11,792 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 461 transitions. [2025-02-06 12:03:11,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 461 transitions. [2025-02-06 12:03:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 12:03:11,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:11,792 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:11,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 12:03:11,793 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:11,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:11,793 INFO L85 PathProgramCache]: Analyzing trace with hash -933088761, now seen corresponding path program 1 times [2025-02-06 12:03:11,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:11,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565860759] [2025-02-06 12:03:11,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:11,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:11,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 12:03:11,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 12:03:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-02-06 12:03:12,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:12,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565860759] [2025-02-06 12:03:12,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565860759] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:12,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:12,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:03:12,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369935537] [2025-02-06 12:03:12,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:12,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:03:12,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:12,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:03:12,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:03:12,037 INFO L87 Difference]: Start difference. First operand 396 states and 461 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:12,144 INFO L93 Difference]: Finished difference Result 413 states and 483 transitions. [2025-02-06 12:03:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:03:12,144 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 121 [2025-02-06 12:03:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:12,146 INFO L225 Difference]: With dead ends: 413 [2025-02-06 12:03:12,148 INFO L226 Difference]: Without dead ends: 413 [2025-02-06 12:03:12,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:03:12,149 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 15 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:12,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1474 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-06 12:03:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 405. [2025-02-06 12:03:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 343 states have (on average 1.358600583090379) internal successors, (466), 400 states have internal predecessors, (466), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 472 transitions. [2025-02-06 12:03:12,168 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 472 transitions. Word has length 121 [2025-02-06 12:03:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:12,169 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 472 transitions. [2025-02-06 12:03:12,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 472 transitions. [2025-02-06 12:03:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-02-06 12:03:12,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:12,170 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:12,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 12:03:12,171 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:12,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1818060609, now seen corresponding path program 1 times [2025-02-06 12:03:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:12,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890675757] [2025-02-06 12:03:12,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:12,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 12:03:12,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 12:03:12,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:12,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 12:03:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890675757] [2025-02-06 12:03:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890675757] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 12:03:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667005214] [2025-02-06 12:03:12,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:12,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:12,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:12,599 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:12,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 12:03:12,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 12:03:13,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 12:03:13,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:13,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:13,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 12:03:13,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:13,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 12:03:13,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667005214] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:13,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 12:03:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-06 12:03:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554505822] [2025-02-06 12:03:13,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:13,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 12:03:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 12:03:13,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 12:03:13,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:03:13,477 INFO L87 Difference]: Start difference. First operand 405 states and 472 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:13,571 INFO L93 Difference]: Finished difference Result 582 states and 691 transitions. [2025-02-06 12:03:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 12:03:13,572 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 122 [2025-02-06 12:03:13,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:13,573 INFO L225 Difference]: With dead ends: 582 [2025-02-06 12:03:13,573 INFO L226 Difference]: Without dead ends: 582 [2025-02-06 12:03:13,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-02-06 12:03:13,574 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 116 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:13,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1731 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 12:03:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-02-06 12:03:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 406. [2025-02-06 12:03:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 344 states have (on average 1.3575581395348837) internal successors, (467), 401 states have internal predecessors, (467), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-06 12:03:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 473 transitions. [2025-02-06 12:03:13,580 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 473 transitions. Word has length 122 [2025-02-06 12:03:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:13,581 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 473 transitions. [2025-02-06 12:03:13,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 473 transitions. [2025-02-06 12:03:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-06 12:03:13,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:13,582 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:13,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 12:03:13,783 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,SelfDestructingSolverStorable32 [2025-02-06 12:03:13,783 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:13,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:13,784 INFO L85 PathProgramCache]: Analyzing trace with hash -829983334, now seen corresponding path program 1 times [2025-02-06 12:03:13,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 12:03:13,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877836241] [2025-02-06 12:03:13,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:13,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 12:03:13,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 12:03:13,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 12:03:13,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:13,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:03:13,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 12:03:13,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-06 12:03:13,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-06 12:03:13,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:13,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 12:03:14,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 12:03:14,031 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 12:03:14,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE (93 of 94 remaining) [2025-02-06 12:03:14,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (92 of 94 remaining) [2025-02-06 12:03:14,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (91 of 94 remaining) [2025-02-06 12:03:14,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (90 of 94 remaining) [2025-02-06 12:03:14,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (89 of 94 remaining) [2025-02-06 12:03:14,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (88 of 94 remaining) [2025-02-06 12:03:14,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (87 of 94 remaining) [2025-02-06 12:03:14,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (86 of 94 remaining) [2025-02-06 12:03:14,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (85 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE (84 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE (83 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (82 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (81 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (80 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2025-02-06 12:03:14,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2025-02-06 12:03:14,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2025-02-06 12:03:14,037 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2025-02-06 12:03:14,038 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK (44 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_DEREFERENCE (28 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2025-02-06 12:03:14,039 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2025-02-06 12:03:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2025-02-06 12:03:14,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 94 remaining) [2025-02-06 12:03:14,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 94 remaining) [2025-02-06 12:03:14,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 12:03:14,046 INFO L422 BasicCegarLoop]: Path program histogram: [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] [2025-02-06 12:03:14,128 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 12:03:14,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:03:14 BoogieIcfgContainer [2025-02-06 12:03:14,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 12:03:14,132 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 12:03:14,132 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 12:03:14,132 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 12:03:14,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:02:36" (3/4) ... [2025-02-06 12:03:14,134 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 12:03:14,135 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 12:03:14,136 INFO L158 Benchmark]: Toolchain (without parser) took 39751.37ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 109.7MB in the beginning and 452.7MB in the end (delta: -343.0MB). Peak memory consumption was 157.4MB. Max. memory is 16.1GB. [2025-02-06 12:03:14,137 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:03:14,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.67ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 63.4MB in the end (delta: 45.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-06 12:03:14,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.53ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 56.7MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 12:03:14,139 INFO L158 Benchmark]: Boogie Preprocessor took 112.78ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 47.2MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 12:03:14,139 INFO L158 Benchmark]: IcfgBuilder took 905.86ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 47.2MB in the beginning and 350.8MB in the end (delta: -303.6MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2025-02-06 12:03:14,139 INFO L158 Benchmark]: TraceAbstraction took 37954.47ms. Allocated memory was 402.7MB in the beginning and 637.5MB in the end (delta: 234.9MB). Free memory was 349.9MB in the beginning and 452.8MB in the end (delta: -102.9MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. [2025-02-06 12:03:14,139 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 637.5MB. Free memory was 452.8MB in the beginning and 452.7MB in the end (delta: 54.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 12:03:14,139 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 696.67ms. Allocated memory is still 142.6MB. Free memory was 109.2MB in the beginning and 63.4MB in the end (delta: 45.8MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.53ms. Allocated memory is still 142.6MB. Free memory was 63.4MB in the beginning and 56.7MB in the end (delta: 6.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 112.78ms. Allocated memory is still 142.6MB. Free memory was 56.7MB in the beginning and 47.2MB in the end (delta: 9.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * IcfgBuilder took 905.86ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 47.2MB in the beginning and 350.8MB in the end (delta: -303.6MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * TraceAbstraction took 37954.47ms. Allocated memory was 402.7MB in the beginning and 637.5MB in the end (delta: 234.9MB). Free memory was 349.9MB in the beginning and 452.8MB in the end (delta: -102.9MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 637.5MB. Free memory was 452.8MB in the beginning and 452.7MB in the end (delta: 54.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1575] char *a = malloc(11); [L1576] a[10] = 0 VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=10] [L1577] COND FALSE !(i<10) [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [a={-1:0}, applet_name={-1:0}, argc=1, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1587] int i=0; VAL [a={-1:0}, applet_name={-1:0}, argc=1, argv={-13:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0, mem_track={-12:0}, optind=1] [L1587] COND TRUE i= 2u [L1394] FCALL bb_show_usage() [L1395] argv = argv + 1l VAL [applet_name={-1:0}, argv={-13:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND FALSE !(!(s == ((const char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1495] return (char *)((void *)0); VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, c=47, dummy_utmp={10:0}, optind=1] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, slash={0:0}] [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] strlen(s) VAL [applet_name={-1:0}, argv={-13:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] - UnprovableResult [Line: 1573]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 242 locations, 94 error locations. Started 1 CEGAR loops. OverallTime: 37.8s, OverallIterations: 34, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7185 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7168 mSDsluCounter, 28999 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21931 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8699 IncrementalHoareTripleChecker+Invalid, 8853 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 7068 mSDtfsCounter, 8699 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1816 GetRequests, 1542 SyntacticMatches, 7 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=33, InterpolantAutomatonStates: 221, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 989 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 21.0s InterpolantComputationTime, 3129 NumberOfCodeBlocks, 2927 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3756 ConstructedInterpolants, 124 QuantifiedInterpolants, 29637 SizeOfPredicates, 51 NumberOfNonLiveVariables, 13817 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 55 InterpolantComputations, 22 PerfectInterpolantSequences, 11258/11653 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 12:03:14,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/basename-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.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 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 12:03:16,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 12:03:16,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2025-02-06 12:03:16,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 12:03:16,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 12:03:16,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 12:03:16,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 12:03:16,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 12:03:16,187 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 12:03:16,187 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 12:03:16,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 12:03:16,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 12:03:16,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 12:03:16,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 12:03:16,188 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 12:03:16,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 12:03:16,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 12:03:16,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 12:03:16,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 12:03:16,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 12:03:16,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 12:03:16,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 12:03:16,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 12:03:16,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:03:16,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 12:03:16,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 12:03:16,191 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 12:03:16,191 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 12:03:16,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 12:03:16,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 12:03:16,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 12:03:16,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 12:03:16,191 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 -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2025-02-06 12:03:16,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 12:03:16,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 12:03:16,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 12:03:16,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 12:03:16,434 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 12:03:16,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-02-06 12:03:17,647 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/814b265dc/0d3523c37fe34a509f178c2bdf9e07d7/FLAGf29502ad9 [2025-02-06 12:03:17,879 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 12:03:17,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2025-02-06 12:03:17,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/814b265dc/0d3523c37fe34a509f178c2bdf9e07d7/FLAGf29502ad9 [2025-02-06 12:03:18,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/814b265dc/0d3523c37fe34a509f178c2bdf9e07d7 [2025-02-06 12:03:18,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 12:03:18,218 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 12:03:18,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 12:03:18,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 12:03:18,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 12:03:18,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:18,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df4fada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18, skipping insertion in model container [2025-02-06 12:03:18,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:18,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 12:03:18,712 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,722 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,724 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,726 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,728 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,737 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,737 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,738 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,739 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,740 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,747 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 12:03:18,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:03:18,779 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 12:03:18,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 12:03:18,966 INFO L204 MainTranslator]: Completed translation [2025-02-06 12:03:18,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18 WrapperNode [2025-02-06 12:03:18,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 12:03:18,968 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 12:03:18,968 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 12:03:18,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 12:03:18,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,049 INFO L138 Inliner]: procedures = 353, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 718 [2025-02-06 12:03:19,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 12:03:19,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 12:03:19,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 12:03:19,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 12:03:19,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,107 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 1, 355, 2, 2, 12, 12]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 0, 355, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 1, 2, 5]. [2025-02-06 12:03:19,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,132 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,143 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 12:03:19,152 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 12:03:19,152 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 12:03:19,152 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 12:03:19,155 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (1/1) ... [2025-02-06 12:03:19,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 12:03:19,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:19,187 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 12:03:19,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 12:03:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 12:03:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 12:03:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 12:03:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 12:03:19,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 12:03:19,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-06 12:03:19,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 12:03:19,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 12:03:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 12:03:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-02-06 12:03:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-02-06 12:03:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-02-06 12:03:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-02-06 12:03:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-02-06 12:03:19,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-02-06 12:03:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-02-06 12:03:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 12:03:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 12:03:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 12:03:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 12:03:19,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 12:03:19,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 12:03:19,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 12:03:19,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-06 12:03:19,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 12:03:19,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 12:03:19,504 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 12:03:19,505 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 12:03:20,649 INFO L? ?]: Removed 257 outVars from TransFormulas that were not future-live. [2025-02-06 12:03:20,650 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 12:03:20,662 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 12:03:20,663 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 12:03:20,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:03:20 BoogieIcfgContainer [2025-02-06 12:03:20,663 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 12:03:20,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 12:03:20,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 12:03:20,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 12:03:20,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:03:18" (1/3) ... [2025-02-06 12:03:20,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7909048c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:03:20, skipping insertion in model container [2025-02-06 12:03:20,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:03:18" (2/3) ... [2025-02-06 12:03:20,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7909048c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:03:20, skipping insertion in model container [2025-02-06 12:03:20,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:03:20" (3/3) ... [2025-02-06 12:03:20,672 INFO L128 eAbstractionObserver]: Analyzing ICFG basename-1.i [2025-02-06 12:03:20,682 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 12:03:20,683 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG basename-1.i that has 2 procedures, 242 locations, 1 initial locations, 7 loop locations, and 94 error locations. [2025-02-06 12:03:20,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 12:03:20,725 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;@7d7188ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 12:03:20,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-02-06 12:03:20,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 144 states have (on average 1.9166666666666667) internal successors, (276), 238 states have internal predecessors, (276), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:03:20,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:20,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:03:20,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:20,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:20,741 INFO L85 PathProgramCache]: Analyzing trace with hash 326664, now seen corresponding path program 1 times [2025-02-06 12:03:20,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:03:20,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415130841] [2025-02-06 12:03:20,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:20,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:20,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:20,768 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:20,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 12:03:21,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:03:21,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:03:21,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:21,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:21,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 12:03:21,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:21,645 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 7 [2025-02-06 12:03:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:21,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:03:21,673 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:03:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415130841] [2025-02-06 12:03:21,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415130841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:21,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:21,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802126773] [2025-02-06 12:03:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:21,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:21,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:03:21,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:21,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:21,707 INFO L87 Difference]: Start difference. First operand has 242 states, 144 states have (on average 1.9166666666666667) internal successors, (276), 238 states have internal predecessors, (276), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:22,488 INFO L93 Difference]: Finished difference Result 251 states and 283 transitions. [2025-02-06 12:03:22,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:03:22,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:22,495 INFO L225 Difference]: With dead ends: 251 [2025-02-06 12:03:22,495 INFO L226 Difference]: Without dead ends: 249 [2025-02-06 12:03:22,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:22,498 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 235 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:22,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 201 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:03:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-06 12:03:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2025-02-06 12:03:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 140 states have (on average 1.8571428571428572) internal successors, (260), 229 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 264 transitions. [2025-02-06 12:03:22,537 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 264 transitions. Word has length 3 [2025-02-06 12:03:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:22,537 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 264 transitions. [2025-02-06 12:03:22,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 264 transitions. [2025-02-06 12:03:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 12:03:22,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:22,538 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 12:03:22,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 12:03:22,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:22,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:22,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash 326665, now seen corresponding path program 1 times [2025-02-06 12:03:22,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:03:22,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1546185852] [2025-02-06 12:03:22,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:22,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:22,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:22,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 12:03:22,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 12:03:23,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 12:03:23,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:23,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:23,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:03:23,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:23,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:03:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:23,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:03:23,488 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:03:23,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546185852] [2025-02-06 12:03:23,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1546185852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:23,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:23,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481658737] [2025-02-06 12:03:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:23,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:03:23,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:23,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:23,489 INFO L87 Difference]: Start difference. First operand 233 states and 264 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:24,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:24,217 INFO L93 Difference]: Finished difference Result 232 states and 263 transitions. [2025-02-06 12:03:24,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:24,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 12:03:24,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:24,219 INFO L225 Difference]: With dead ends: 232 [2025-02-06 12:03:24,219 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 12:03:24,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:24,220 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 6 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:24,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 427 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 12:03:24,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 12:03:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2025-02-06 12:03:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 140 states have (on average 1.85) internal successors, (259), 228 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:24,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 263 transitions. [2025-02-06 12:03:24,230 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 263 transitions. Word has length 3 [2025-02-06 12:03:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:24,230 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 263 transitions. [2025-02-06 12:03:24,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 263 transitions. [2025-02-06 12:03:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 12:03:24,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:24,231 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 12:03:24,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 12:03:24,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:24,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:24,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:24,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1141974750, now seen corresponding path program 1 times [2025-02-06 12:03:24,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:03:24,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81761864] [2025-02-06 12:03:24,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:24,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:24,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:24,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:24,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 12:03:24,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 12:03:25,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 12:03:25,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:25,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:25,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 12:03:25,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:25,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:03:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:25,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:03:25,549 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:03:25,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81761864] [2025-02-06 12:03:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81761864] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:25,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 12:03:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133487780] [2025-02-06 12:03:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:25,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 12:03:25,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:03:25,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 12:03:25,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:25,550 INFO L87 Difference]: Start difference. First operand 232 states and 263 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:26,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:26,428 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2025-02-06 12:03:26,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 12:03:26,429 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 12:03:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:26,430 INFO L225 Difference]: With dead ends: 235 [2025-02-06 12:03:26,430 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 12:03:26,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 12:03:26,431 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 6 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:26,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 594 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 12:03:26,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 12:03:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 234. [2025-02-06 12:03:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 142 states have (on average 1.8380281690140845) internal successors, (261), 230 states have internal predecessors, (261), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions. [2025-02-06 12:03:26,437 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 6 [2025-02-06 12:03:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:26,437 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 265 transitions. [2025-02-06 12:03:26,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions. [2025-02-06 12:03:26,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 12:03:26,438 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:26,438 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:26,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 12:03:26,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:26,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:26,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:26,641 INFO L85 PathProgramCache]: Analyzing trace with hash 134053156, now seen corresponding path program 1 times [2025-02-06 12:03:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:03:26,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1703547690] [2025-02-06 12:03:26,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:26,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:26,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:26,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:26,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 12:03:26,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 12:03:27,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 12:03:27,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:27,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:27,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 12:03:27,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:27,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:03:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:27,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:28,123 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:03:28,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703547690] [2025-02-06 12:03:28,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703547690] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:28,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:03:28,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-02-06 12:03:28,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160367058] [2025-02-06 12:03:28,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:28,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 12:03:28,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:03:28,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 12:03:28,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 12:03:28,125 INFO L87 Difference]: Start difference. First operand 234 states and 265 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:30,619 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2025-02-06 12:03:30,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 12:03:30,621 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 12:03:30,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:30,622 INFO L225 Difference]: With dead ends: 238 [2025-02-06 12:03:30,622 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 12:03:30,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-02-06 12:03:30,623 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 8 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:30,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 932 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 12:03:30,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 12:03:30,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-02-06 12:03:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 147 states have (on average 1.8027210884353742) internal successors, (265), 234 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 269 transitions. [2025-02-06 12:03:30,637 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 269 transitions. Word has length 9 [2025-02-06 12:03:30,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:30,637 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 269 transitions. [2025-02-06 12:03:30,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 12:03:30,637 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 269 transitions. [2025-02-06 12:03:30,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 12:03:30,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:30,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:30,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 12:03:30,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:30,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:30,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:30,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1327559198, now seen corresponding path program 1 times [2025-02-06 12:03:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:03:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549951140] [2025-02-06 12:03:30,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:30,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:30,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:30,842 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:30,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 12:03:30,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 12:03:31,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 12:03:31,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:31,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:31,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 12:03:31,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:31,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:03:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:31,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:32,302 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:03:32,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549951140] [2025-02-06 12:03:32,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549951140] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:32,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:03:32,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2025-02-06 12:03:32,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549960138] [2025-02-06 12:03:32,303 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:32,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 12:03:32,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:03:32,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 12:03:32,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-02-06 12:03:32,308 INFO L87 Difference]: Start difference. First operand 238 states and 269 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:03:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:34,490 INFO L93 Difference]: Finished difference Result 253 states and 284 transitions. [2025-02-06 12:03:34,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 12:03:34,491 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-02-06 12:03:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:34,492 INFO L225 Difference]: With dead ends: 253 [2025-02-06 12:03:34,492 INFO L226 Difference]: Without dead ends: 253 [2025-02-06 12:03:34,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2025-02-06 12:03:34,493 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 33 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:34,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1778 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-06 12:03:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-06 12:03:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-02-06 12:03:34,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 162 states have (on average 1.728395061728395) internal successors, (280), 249 states have internal predecessors, (280), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:34,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 284 transitions. [2025-02-06 12:03:34,499 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 284 transitions. Word has length 21 [2025-02-06 12:03:34,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:34,499 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 284 transitions. [2025-02-06 12:03:34,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:03:34,499 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 284 transitions. [2025-02-06 12:03:34,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:03:34,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:34,500 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:34,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 12:03:34,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:34,700 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:34,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:34,701 INFO L85 PathProgramCache]: Analyzing trace with hash 881187736, now seen corresponding path program 2 times [2025-02-06 12:03:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:03:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815115219] [2025-02-06 12:03:34,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:34,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:34,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:34,704 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:34,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 12:03:34,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-02-06 12:03:35,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 36 statements. [2025-02-06 12:03:35,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:03:35,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:35,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 12:03:35,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:35,551 INFO L349 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2025-02-06 12:03:35,551 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 15 [2025-02-06 12:03:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-02-06 12:03:35,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:03:35,565 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:03:35,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815115219] [2025-02-06 12:03:35,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815115219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:35,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:35,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 12:03:35,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016676399] [2025-02-06 12:03:35,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:35,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 12:03:35,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:03:35,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 12:03:35,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:35,567 INFO L87 Difference]: Start difference. First operand 253 states and 284 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:36,068 INFO L93 Difference]: Finished difference Result 264 states and 296 transitions. [2025-02-06 12:03:36,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 12:03:36,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2025-02-06 12:03:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:36,070 INFO L225 Difference]: With dead ends: 264 [2025-02-06 12:03:36,070 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 12:03:36,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 12:03:36,071 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 219 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:36,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 202 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 12:03:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 12:03:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 248. [2025-02-06 12:03:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.6975308641975309) internal successors, (275), 244 states have internal predecessors, (275), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 279 transitions. [2025-02-06 12:03:36,078 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 279 transitions. Word has length 36 [2025-02-06 12:03:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:36,079 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 279 transitions. [2025-02-06 12:03:36,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 279 transitions. [2025-02-06 12:03:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 12:03:36,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:36,080 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:36,117 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-06 12:03:36,281 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 [2025-02-06 12:03:36,281 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:36,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:36,282 INFO L85 PathProgramCache]: Analyzing trace with hash 881187737, now seen corresponding path program 1 times [2025-02-06 12:03:36,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:03:36,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [787256117] [2025-02-06 12:03:36,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:36,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:36,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:36,286 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:36,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 12:03:36,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 12:03:37,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 12:03:37,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:37,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:37,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 12:03:37,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:37,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 12:03:37,503 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:37,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 12:03:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 12:03:40,350 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:03:40,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787256117] [2025-02-06 12:03:40,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787256117] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 12:03:40,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 12:03:40,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2025-02-06 12:03:40,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522949467] [2025-02-06 12:03:40,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 12:03:40,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 12:03:40,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:03:40,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 12:03:40,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2025-02-06 12:03:40,354 INFO L87 Difference]: Start difference. First operand 248 states and 279 transitions. Second operand has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:03:49,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:49,424 INFO L93 Difference]: Finished difference Result 278 states and 310 transitions. [2025-02-06 12:03:49,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 12:03:49,425 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2025-02-06 12:03:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:49,427 INFO L225 Difference]: With dead ends: 278 [2025-02-06 12:03:49,427 INFO L226 Difference]: Without dead ends: 278 [2025-02-06 12:03:49,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=354, Invalid=836, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 12:03:49,428 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 63 mSDsluCounter, 1889 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 2140 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:49,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 2140 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-02-06 12:03:49,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-06 12:03:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-02-06 12:03:49,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 192 states have (on average 1.59375) internal successors, (306), 274 states have internal predecessors, (306), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 310 transitions. [2025-02-06 12:03:49,434 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 310 transitions. Word has length 36 [2025-02-06 12:03:49,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:49,434 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 310 transitions. [2025-02-06 12:03:49,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 24 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-06 12:03:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 310 transitions. [2025-02-06 12:03:49,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 12:03:49,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:49,435 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:49,474 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-06 12:03:49,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:49,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:49,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:49,636 INFO L85 PathProgramCache]: Analyzing trace with hash 176455129, now seen corresponding path program 2 times [2025-02-06 12:03:49,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:03:49,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1421809755] [2025-02-06 12:03:49,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 12:03:49,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:49,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:49,638 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:49,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 12:03:49,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-02-06 12:03:50,336 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-02-06 12:03:50,336 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 12:03:50,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:50,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 12:03:50,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:50,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:50,472 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 16 treesize of output 10 [2025-02-06 12:03:50,483 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 10 treesize of output 8 [2025-02-06 12:03:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:03:50,523 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:03:50,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:03:50,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421809755] [2025-02-06 12:03:50,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421809755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:50,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:50,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 12:03:50,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622638237] [2025-02-06 12:03:50,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:50,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 12:03:50,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:03:50,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 12:03:50,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:50,524 INFO L87 Difference]: Start difference. First operand 278 states and 310 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 12:03:52,117 INFO L93 Difference]: Finished difference Result 441 states and 503 transitions. [2025-02-06 12:03:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 12:03:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2025-02-06 12:03:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 12:03:52,125 INFO L225 Difference]: With dead ends: 441 [2025-02-06 12:03:52,125 INFO L226 Difference]: Without dead ends: 441 [2025-02-06 12:03:52,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 12:03:52,126 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 411 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-06 12:03:52,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 753 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-06 12:03:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-02-06 12:03:52,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 277. [2025-02-06 12:03:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 192 states have (on average 1.5885416666666667) internal successors, (305), 273 states have internal predecessors, (305), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-06 12:03:52,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 309 transitions. [2025-02-06 12:03:52,135 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 309 transitions. Word has length 42 [2025-02-06 12:03:52,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 12:03:52,136 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 309 transitions. [2025-02-06 12:03:52,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-06 12:03:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 309 transitions. [2025-02-06 12:03:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-06 12:03:52,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 12:03:52,138 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 12:03:52,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 12:03:52,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:52,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 91 more)] === [2025-02-06 12:03:52,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 12:03:52,340 INFO L85 PathProgramCache]: Analyzing trace with hash -265001854, now seen corresponding path program 1 times [2025-02-06 12:03:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 12:03:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [388872464] [2025-02-06 12:03:52,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 12:03:52,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 12:03:52,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 12:03:52,344 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 12:03:52,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 12:03:52,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-06 12:03:53,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 12:03:53,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 12:03:53,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 12:03:53,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 12:03:53,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 12:03:53,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:53,131 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 16 treesize of output 10 [2025-02-06 12:03:53,142 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 10 treesize of output 8 [2025-02-06 12:03:53,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 12:03:53,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2025-02-06 12:03:53,416 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2025-02-06 12:03:53,416 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 13 treesize of output 13 [2025-02-06 12:03:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-06 12:03:53,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 12:03:53,671 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 12:03:53,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388872464] [2025-02-06 12:03:53,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [388872464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 12:03:53,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 12:03:53,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 12:03:53,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209309669] [2025-02-06 12:03:53,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 12:03:53,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 12:03:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 12:03:53,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 12:03:53,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 12:03:53,673 INFO L87 Difference]: Start difference. First operand 277 states and 309 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)