./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:55:12,342 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:55:12,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 07:55:12,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:55:12,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:55:12,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:55:12,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:55:12,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:55:12,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:55:12,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:55:12,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:55:12,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:55:12,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:55:12,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:55:12,432 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:55:12,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:55:12,434 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 07:55:12,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:55:12,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 07:55:12,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:55:12,435 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:55:12,435 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:55:12,435 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:55:12,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:55:12,435 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:55:12,435 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:55:12,435 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 07:55:12,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:55:12,435 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:55:12,436 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:55:12,436 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:55:12,436 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:55:12,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:55:12,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:55:12,436 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:55:12,436 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:55:12,436 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:55:12,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:55:12,437 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:55:12,437 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:55:12,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:55:12,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:55:12,437 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ddeff00ba0e288e2e7b04a6005a0db991f8cee358fe3ef021af7107ab321b8e [2025-02-08 07:55:12,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:55:12,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:55:12,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:55:12,700 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:55:12,701 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:55:12,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2025-02-08 07:55:13,942 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2037e8247/089a615701c24c2f84d2cc65de031a9f/FLAG381520303 [2025-02-08 07:55:14,275 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:55:14,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test4-1.i [2025-02-08 07:55:14,287 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2037e8247/089a615701c24c2f84d2cc65de031a9f/FLAG381520303 [2025-02-08 07:55:14,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2037e8247/089a615701c24c2f84d2cc65de031a9f [2025-02-08 07:55:14,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:55:14,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:55:14,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:55:14,533 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:55:14,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:55:14,538 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:55:14" (1/1) ... [2025-02-08 07:55:14,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:14, skipping insertion in model container [2025-02-08 07:55:14,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:55:14" (1/1) ... [2025-02-08 07:55:14,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:55:14,911 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:14,941 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:14,944 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:14,949 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:14,952 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:14,972 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:14,974 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:14,977 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:14,982 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:15,001 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-08 07:55:15,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:55:15,024 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:55:15,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:55:15,144 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:55:15,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15 WrapperNode [2025-02-08 07:55:15,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:55:15,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:55:15,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:55:15,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:55:15,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,165 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,223 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1557 [2025-02-08 07:55:15,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:55:15,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:55:15,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:55:15,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:55:15,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,246 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,320 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2025-02-08 07:55:15,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,325 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:55:15,420 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:55:15,421 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:55:15,421 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:55:15,422 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (1/1) ... [2025-02-08 07:55:15,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:55:15,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:55:15,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 07:55:15,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 07:55:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 07:55:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 07:55:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 07:55:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 07:55:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 07:55:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 07:55:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 07:55:15,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 07:55:15,465 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 07:55:15,466 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 07:55:15,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:55:15,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:55:15,598 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:55:15,600 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:55:17,640 INFO L? ?]: Removed 1501 outVars from TransFormulas that were not future-live. [2025-02-08 07:55:17,640 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:55:17,712 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:55:17,712 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-08 07:55:17,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:55:17 BoogieIcfgContainer [2025-02-08 07:55:17,712 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:55:17,718 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:55:17,718 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:55:17,722 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:55:17,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:55:14" (1/3) ... [2025-02-08 07:55:17,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb785e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:55:17, skipping insertion in model container [2025-02-08 07:55:17,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:55:15" (2/3) ... [2025-02-08 07:55:17,723 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eb785e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:55:17, skipping insertion in model container [2025-02-08 07:55:17,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:55:17" (3/3) ... [2025-02-08 07:55:17,724 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test4-1.i [2025-02-08 07:55:17,735 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:55:17,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test4-1.i that has 4 procedures, 1461 locations, 1 initial locations, 36 loop locations, and 628 error locations. [2025-02-08 07:55:17,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:55:17,807 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;@1471a5a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:55:17,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2025-02-08 07:55:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 1456 states, 814 states have (on average 2.063882063882064) internal successors, (1680), 1446 states have internal predecessors, (1680), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-02-08 07:55:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:55:17,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:17,819 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:55:17,819 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:17,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash 55225439, now seen corresponding path program 1 times [2025-02-08 07:55:17,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:17,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521141762] [2025-02-08 07:55:17,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:17,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:17,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:55:17,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:55:17,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:17,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:17,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:17,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521141762] [2025-02-08 07:55:17,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521141762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:17,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:17,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:55:17,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433579372] [2025-02-08 07:55:17,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:17,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 07:55:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:17,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 07:55:17,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 07:55:17,978 INFO L87 Difference]: Start difference. First operand has 1456 states, 814 states have (on average 2.063882063882064) internal successors, (1680), 1446 states have internal predecessors, (1680), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:18,120 INFO L93 Difference]: Finished difference Result 1437 states and 1630 transitions. [2025-02-08 07:55:18,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 07:55:18,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-08 07:55:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:18,142 INFO L225 Difference]: With dead ends: 1437 [2025-02-08 07:55:18,142 INFO L226 Difference]: Without dead ends: 1432 [2025-02-08 07:55:18,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 07:55:18,147 INFO L435 NwaCegarLoop]: 1586 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1586 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:18,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1586 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:55:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2025-02-08 07:55:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1432. [2025-02-08 07:55:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 803 states have (on average 1.9850560398505603) internal successors, (1594), 1423 states have internal predecessors, (1594), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 1616 transitions. [2025-02-08 07:55:18,282 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 1616 transitions. Word has length 4 [2025-02-08 07:55:18,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:18,286 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 1616 transitions. [2025-02-08 07:55:18,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:18,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 1616 transitions. [2025-02-08 07:55:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:55:18,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:18,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:55:18,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:55:18,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:18,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:18,287 INFO L85 PathProgramCache]: Analyzing trace with hash 55225470, now seen corresponding path program 1 times [2025-02-08 07:55:18,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191765434] [2025-02-08 07:55:18,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:18,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:18,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:55:18,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:55:18,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:18,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:18,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:18,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191765434] [2025-02-08 07:55:18,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191765434] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:18,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:18,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:55:18,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119656227] [2025-02-08 07:55:18,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:18,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:55:18,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:18,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:55:18,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:18,398 INFO L87 Difference]: Start difference. First operand 1432 states and 1616 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:19,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:19,492 INFO L93 Difference]: Finished difference Result 1852 states and 2130 transitions. [2025-02-08 07:55:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:55:19,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 07:55:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:19,498 INFO L225 Difference]: With dead ends: 1852 [2025-02-08 07:55:19,498 INFO L226 Difference]: Without dead ends: 1852 [2025-02-08 07:55:19,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:19,499 INFO L435 NwaCegarLoop]: 1300 mSDtfsCounter, 825 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 1926 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:19,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 1926 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:55:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1852 states. [2025-02-08 07:55:19,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1852 to 1700. [2025-02-08 07:55:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1700 states, 1081 states have (on average 1.9324699352451433) internal successors, (2089), 1691 states have internal predecessors, (2089), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2111 transitions. [2025-02-08 07:55:19,539 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2111 transitions. Word has length 4 [2025-02-08 07:55:19,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:19,539 INFO L471 AbstractCegarLoop]: Abstraction has 1700 states and 2111 transitions. [2025-02-08 07:55:19,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2111 transitions. [2025-02-08 07:55:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:55:19,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:19,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:55:19,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:55:19,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr625REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:19,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash 55225469, now seen corresponding path program 1 times [2025-02-08 07:55:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814445011] [2025-02-08 07:55:19,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:19,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:55:19,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:55:19,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:19,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:19,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:19,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814445011] [2025-02-08 07:55:19,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814445011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:19,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:19,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:55:19,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280421084] [2025-02-08 07:55:19,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:19,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:55:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:19,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:55:19,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:19,590 INFO L87 Difference]: Start difference. First operand 1700 states and 2111 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:20,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:20,351 INFO L93 Difference]: Finished difference Result 1607 states and 2003 transitions. [2025-02-08 07:55:20,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:55:20,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-02-08 07:55:20,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:20,356 INFO L225 Difference]: With dead ends: 1607 [2025-02-08 07:55:20,356 INFO L226 Difference]: Without dead ends: 1607 [2025-02-08 07:55:20,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:20,359 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 1371 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:20,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1377 Valid, 874 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 07:55:20,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2025-02-08 07:55:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1606. [2025-02-08 07:55:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1081 states have (on average 1.8307123034227568) internal successors, (1979), 1597 states have internal predecessors, (1979), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:20,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2001 transitions. [2025-02-08 07:55:20,391 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2001 transitions. Word has length 4 [2025-02-08 07:55:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:20,391 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2001 transitions. [2025-02-08 07:55:20,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:20,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2001 transitions. [2025-02-08 07:55:20,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:55:20,392 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:20,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:55:20,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:55:20,392 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:20,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:20,392 INFO L85 PathProgramCache]: Analyzing trace with hash 53559216, now seen corresponding path program 1 times [2025-02-08 07:55:20,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:20,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764252212] [2025-02-08 07:55:20,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:20,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:20,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:55:20,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:55:20,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:20,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:20,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:20,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764252212] [2025-02-08 07:55:20,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764252212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:20,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:20,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:55:20,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366929479] [2025-02-08 07:55:20,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:55:20,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:20,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:55:20,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:20,431 INFO L87 Difference]: Start difference. First operand 1606 states and 2001 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:20,552 INFO L93 Difference]: Finished difference Result 3169 states and 3949 transitions. [2025-02-08 07:55:20,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:55:20,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-02-08 07:55:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:20,563 INFO L225 Difference]: With dead ends: 3169 [2025-02-08 07:55:20,563 INFO L226 Difference]: Without dead ends: 3169 [2025-02-08 07:55:20,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:20,564 INFO L435 NwaCegarLoop]: 1743 mSDtfsCounter, 1446 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1452 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:20,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1452 Valid, 3206 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:55:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3169 states. [2025-02-08 07:55:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3169 to 1607. [2025-02-08 07:55:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1082 states have (on average 1.8299445471349354) internal successors, (1980), 1598 states have internal predecessors, (1980), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:20,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2002 transitions. [2025-02-08 07:55:20,605 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2002 transitions. Word has length 4 [2025-02-08 07:55:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:20,605 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2002 transitions. [2025-02-08 07:55:20,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2002 transitions. [2025-02-08 07:55:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 07:55:20,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:20,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:20,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:55:20,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:20,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:20,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1235014070, now seen corresponding path program 1 times [2025-02-08 07:55:20,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:20,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595394028] [2025-02-08 07:55:20,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:20,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 07:55:20,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 07:55:20,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:20,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:20,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:20,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595394028] [2025-02-08 07:55:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595394028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:20,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:20,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:55:20,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74542310] [2025-02-08 07:55:20,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:20,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:55:20,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:20,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:55:20,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:55:20,691 INFO L87 Difference]: Start difference. First operand 1607 states and 2002 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:21,643 INFO L93 Difference]: Finished difference Result 1633 states and 2055 transitions. [2025-02-08 07:55:21,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:55:21,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 07:55:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:21,648 INFO L225 Difference]: With dead ends: 1633 [2025-02-08 07:55:21,648 INFO L226 Difference]: Without dead ends: 1633 [2025-02-08 07:55:21,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:55:21,649 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 1638 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:21,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 1545 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 07:55:21,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-02-08 07:55:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1584. [2025-02-08 07:55:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1082 states have (on average 1.8086876155268021) internal successors, (1957), 1575 states have internal predecessors, (1957), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:21,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 1979 transitions. [2025-02-08 07:55:21,670 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 1979 transitions. Word has length 10 [2025-02-08 07:55:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:21,670 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 1979 transitions. [2025-02-08 07:55:21,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 1979 transitions. [2025-02-08 07:55:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 07:55:21,671 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:21,671 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:21,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 07:55:21,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:21,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:21,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1235014071, now seen corresponding path program 1 times [2025-02-08 07:55:21,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:21,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792438818] [2025-02-08 07:55:21,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:21,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 07:55:21,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 07:55:21,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:21,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:21,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792438818] [2025-02-08 07:55:21,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792438818] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:21,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:21,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:55:21,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86399320] [2025-02-08 07:55:21,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:21,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:55:21,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:21,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:55:21,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:21,741 INFO L87 Difference]: Start difference. First operand 1584 states and 1979 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:21,804 INFO L93 Difference]: Finished difference Result 1509 states and 1876 transitions. [2025-02-08 07:55:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:55:21,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-08 07:55:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:21,808 INFO L225 Difference]: With dead ends: 1509 [2025-02-08 07:55:21,809 INFO L226 Difference]: Without dead ends: 1509 [2025-02-08 07:55:21,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:21,809 INFO L435 NwaCegarLoop]: 1340 mSDtfsCounter, 60 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:21,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 2627 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:55:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-02-08 07:55:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2025-02-08 07:55:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1019 states have (on average 1.8194308145240432) internal successors, (1854), 1500 states have internal predecessors, (1854), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1876 transitions. [2025-02-08 07:55:21,828 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1876 transitions. Word has length 10 [2025-02-08 07:55:21,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:21,828 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 1876 transitions. [2025-02-08 07:55:21,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1876 transitions. [2025-02-08 07:55:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 07:55:21,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:21,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:21,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:55:21,829 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:21,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:21,829 INFO L85 PathProgramCache]: Analyzing trace with hash -369392867, now seen corresponding path program 1 times [2025-02-08 07:55:21,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:21,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638015674] [2025-02-08 07:55:21,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:21,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:21,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 07:55:21,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 07:55:21,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:21,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:21,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:21,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638015674] [2025-02-08 07:55:21,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638015674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:21,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:21,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:55:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341884325] [2025-02-08 07:55:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:21,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:55:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:21,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:55:21,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:55:21,890 INFO L87 Difference]: Start difference. First operand 1509 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:22,050 INFO L93 Difference]: Finished difference Result 1491 states and 1851 transitions. [2025-02-08 07:55:22,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:55:22,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-02-08 07:55:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:22,054 INFO L225 Difference]: With dead ends: 1491 [2025-02-08 07:55:22,055 INFO L226 Difference]: Without dead ends: 1491 [2025-02-08 07:55:22,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:55:22,055 INFO L435 NwaCegarLoop]: 1305 mSDtfsCounter, 41 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3887 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:22,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3887 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:55:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2025-02-08 07:55:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 1488. [2025-02-08 07:55:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1005 states have (on average 1.8169154228855722) internal successors, (1826), 1479 states have internal predecessors, (1826), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1848 transitions. [2025-02-08 07:55:22,073 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1848 transitions. Word has length 11 [2025-02-08 07:55:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:22,073 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1848 transitions. [2025-02-08 07:55:22,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:22,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1848 transitions. [2025-02-08 07:55:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 07:55:22,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:22,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:22,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:55:22,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr584REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:22,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:22,075 INFO L85 PathProgramCache]: Analyzing trace with hash 681767507, now seen corresponding path program 1 times [2025-02-08 07:55:22,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:22,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474837593] [2025-02-08 07:55:22,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:22,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:22,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 07:55:22,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 07:55:22,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:22,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:22,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:22,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:22,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474837593] [2025-02-08 07:55:22,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474837593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:22,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:22,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:55:22,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045461371] [2025-02-08 07:55:22,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:22,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:55:22,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:22,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:55:22,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:55:22,245 INFO L87 Difference]: Start difference. First operand 1488 states and 1848 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:23,194 INFO L93 Difference]: Finished difference Result 1685 states and 1939 transitions. [2025-02-08 07:55:23,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:55:23,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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 25 [2025-02-08 07:55:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:23,199 INFO L225 Difference]: With dead ends: 1685 [2025-02-08 07:55:23,199 INFO L226 Difference]: Without dead ends: 1685 [2025-02-08 07:55:23,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:55:23,200 INFO L435 NwaCegarLoop]: 1124 mSDtfsCounter, 830 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:23,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 2475 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 07:55:23,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1685 states. [2025-02-08 07:55:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1685 to 1484. [2025-02-08 07:55:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1005 states have (on average 1.8129353233830845) internal successors, (1822), 1475 states have internal predecessors, (1822), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1844 transitions. [2025-02-08 07:55:23,218 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1844 transitions. Word has length 25 [2025-02-08 07:55:23,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:23,218 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1844 transitions. [2025-02-08 07:55:23,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1844 transitions. [2025-02-08 07:55:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 07:55:23,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:23,219 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:23,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 07:55:23,219 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr569REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:23,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:23,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1332603509, now seen corresponding path program 1 times [2025-02-08 07:55:23,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:23,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61856047] [2025-02-08 07:55:23,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:23,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:23,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 07:55:23,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 07:55:23,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:23,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:23,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61856047] [2025-02-08 07:55:23,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61856047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:23,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:23,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:55:23,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835496383] [2025-02-08 07:55:23,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:23,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:55:23,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:23,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:55:23,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:55:23,302 INFO L87 Difference]: Start difference. First operand 1484 states and 1844 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:23,402 INFO L93 Difference]: Finished difference Result 1484 states and 1840 transitions. [2025-02-08 07:55:23,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:55:23,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2025-02-08 07:55:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:23,410 INFO L225 Difference]: With dead ends: 1484 [2025-02-08 07:55:23,411 INFO L226 Difference]: Without dead ends: 1484 [2025-02-08 07:55:23,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:55:23,412 INFO L435 NwaCegarLoop]: 1300 mSDtfsCounter, 21 mSDsluCounter, 2569 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3869 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:23,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3869 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:55:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2025-02-08 07:55:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1484. [2025-02-08 07:55:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1005 states have (on average 1.808955223880597) internal successors, (1818), 1475 states have internal predecessors, (1818), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1840 transitions. [2025-02-08 07:55:23,430 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1840 transitions. Word has length 60 [2025-02-08 07:55:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:23,430 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1840 transitions. [2025-02-08 07:55:23,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1840 transitions. [2025-02-08 07:55:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 07:55:23,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:23,433 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:23,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:55:23,433 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr569REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:23,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash -447671379, now seen corresponding path program 1 times [2025-02-08 07:55:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:23,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756548102] [2025-02-08 07:55:23,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:23,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:23,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 07:55:23,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 07:55:23,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:23,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:23,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756548102] [2025-02-08 07:55:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756548102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:23,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:23,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:55:23,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867396303] [2025-02-08 07:55:23,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:23,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:55:23,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:23,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:55:23,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:23,537 INFO L87 Difference]: Start difference. First operand 1484 states and 1840 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:23,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:23,631 INFO L93 Difference]: Finished difference Result 1576 states and 1959 transitions. [2025-02-08 07:55:23,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:55:23,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 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 68 [2025-02-08 07:55:23,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:23,635 INFO L225 Difference]: With dead ends: 1576 [2025-02-08 07:55:23,635 INFO L226 Difference]: Without dead ends: 1576 [2025-02-08 07:55:23,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:55:23,636 INFO L435 NwaCegarLoop]: 1314 mSDtfsCounter, 54 mSDsluCounter, 1287 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:23,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2601 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:55:23,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-02-08 07:55:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2025-02-08 07:55:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1097 states have (on average 1.7657247037374657) internal successors, (1937), 1567 states have internal predecessors, (1937), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1959 transitions. [2025-02-08 07:55:23,679 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1959 transitions. Word has length 68 [2025-02-08 07:55:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:23,679 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1959 transitions. [2025-02-08 07:55:23,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 2 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1959 transitions. [2025-02-08 07:55:23,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-08 07:55:23,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:23,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:23,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:55:23,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr540REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:23,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash -705571986, now seen corresponding path program 1 times [2025-02-08 07:55:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:23,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577677429] [2025-02-08 07:55:23,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:23,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:23,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-08 07:55:23,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-08 07:55:23,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:24,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:24,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577677429] [2025-02-08 07:55:24,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577677429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:24,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:24,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:55:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745507555] [2025-02-08 07:55:24,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:24,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:55:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:24,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:55:24,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:55:24,107 INFO L87 Difference]: Start difference. First operand 1576 states and 1959 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:25,501 INFO L93 Difference]: Finished difference Result 1492 states and 1875 transitions. [2025-02-08 07:55:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:55:25,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2025-02-08 07:55:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:25,505 INFO L225 Difference]: With dead ends: 1492 [2025-02-08 07:55:25,505 INFO L226 Difference]: Without dead ends: 1492 [2025-02-08 07:55:25,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:55:25,506 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 1161 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:25,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 1596 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2147 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:55:25,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-02-08 07:55:25,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1214. [2025-02-08 07:55:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 819 states have (on average 1.6654456654456655) internal successors, (1364), 1205 states have internal predecessors, (1364), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1386 transitions. [2025-02-08 07:55:25,520 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1386 transitions. Word has length 71 [2025-02-08 07:55:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:25,520 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1386 transitions. [2025-02-08 07:55:25,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1386 transitions. [2025-02-08 07:55:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:55:25,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:25,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:25,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:55:25,521 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr533REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:25,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1311678136, now seen corresponding path program 1 times [2025-02-08 07:55:25,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:25,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181202684] [2025-02-08 07:55:25,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:25,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:25,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 07:55:25,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:55:25,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:25,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:25,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:25,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181202684] [2025-02-08 07:55:25,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181202684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:25,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:25,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:55:25,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793581757] [2025-02-08 07:55:25,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:25,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:55:25,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:25,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:55:25,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:55:25,698 INFO L87 Difference]: Start difference. First operand 1214 states and 1386 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:26,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:26,487 INFO L93 Difference]: Finished difference Result 1213 states and 1385 transitions. [2025-02-08 07:55:26,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:55:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-08 07:55:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:26,490 INFO L225 Difference]: With dead ends: 1213 [2025-02-08 07:55:26,490 INFO L226 Difference]: Without dead ends: 1213 [2025-02-08 07:55:26,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:55:26,491 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 2 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:26,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3447 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 07:55:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2025-02-08 07:55:26,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1213. [2025-02-08 07:55:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 819 states have (on average 1.6642246642246643) internal successors, (1363), 1204 states have internal predecessors, (1363), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1385 transitions. [2025-02-08 07:55:26,501 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1385 transitions. Word has length 76 [2025-02-08 07:55:26,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:26,501 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1385 transitions. [2025-02-08 07:55:26,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1385 transitions. [2025-02-08 07:55:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:55:26,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:26,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:26,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:55:26,502 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1311678137, now seen corresponding path program 1 times [2025-02-08 07:55:26,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:26,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800060747] [2025-02-08 07:55:26,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:26,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:26,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 07:55:26,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:55:26,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:26,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:26,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:26,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800060747] [2025-02-08 07:55:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800060747] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:26,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:26,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:55:26,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524042289] [2025-02-08 07:55:26,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:26,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:55:26,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:26,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:55:26,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:55:26,812 INFO L87 Difference]: Start difference. First operand 1213 states and 1385 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:27,657 INFO L93 Difference]: Finished difference Result 1212 states and 1384 transitions. [2025-02-08 07:55:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:55:27,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2025-02-08 07:55:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:27,660 INFO L225 Difference]: With dead ends: 1212 [2025-02-08 07:55:27,660 INFO L226 Difference]: Without dead ends: 1212 [2025-02-08 07:55:27,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:55:27,661 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 1 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3462 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:27,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3462 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 07:55:27,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2025-02-08 07:55:27,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2025-02-08 07:55:27,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 818 states have (on average 1.6650366748166259) internal successors, (1362), 1203 states have internal predecessors, (1362), 16 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:27,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1384 transitions. [2025-02-08 07:55:27,671 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1384 transitions. Word has length 76 [2025-02-08 07:55:27,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:27,671 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1384 transitions. [2025-02-08 07:55:27,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 07:55:27,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1384 transitions. [2025-02-08 07:55:27,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:55:27,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:27,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:27,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:55:27,672 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr529REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:27,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:27,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1404976341, now seen corresponding path program 1 times [2025-02-08 07:55:27,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:27,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115345030] [2025-02-08 07:55:27,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:27,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:27,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:55:27,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:55:27,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:27,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:27,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:27,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115345030] [2025-02-08 07:55:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115345030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:27,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:27,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:55:27,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544604965] [2025-02-08 07:55:27,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:27,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:55:27,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:27,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:55:27,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:55:27,884 INFO L87 Difference]: Start difference. First operand 1212 states and 1384 transitions. Second operand has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:28,785 INFO L93 Difference]: Finished difference Result 1224 states and 1402 transitions. [2025-02-08 07:55:28,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:55:28,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 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 84 [2025-02-08 07:55:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:28,790 INFO L225 Difference]: With dead ends: 1224 [2025-02-08 07:55:28,790 INFO L226 Difference]: Without dead ends: 1224 [2025-02-08 07:55:28,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-08 07:55:28,790 INFO L435 NwaCegarLoop]: 1211 mSDtfsCounter, 10 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 1643 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 4674 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:28,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 4674 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1643 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-08 07:55:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-02-08 07:55:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1218. [2025-02-08 07:55:28,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 823 states have (on average 1.663426488456865) internal successors, (1369), 1208 states have internal predecessors, (1369), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-08 07:55:28,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1397 transitions. [2025-02-08 07:55:28,807 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1397 transitions. Word has length 84 [2025-02-08 07:55:28,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:28,807 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1397 transitions. [2025-02-08 07:55:28,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:28,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1397 transitions. [2025-02-08 07:55:28,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:55:28,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:28,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:28,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 07:55:28,808 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:28,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:28,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1404976342, now seen corresponding path program 1 times [2025-02-08 07:55:28,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:28,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693720801] [2025-02-08 07:55:28,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:28,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:28,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:55:28,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:55:28,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:28,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:29,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:29,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693720801] [2025-02-08 07:55:29,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693720801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:29,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:29,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:55:29,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999970542] [2025-02-08 07:55:29,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:29,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:55:29,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:29,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:55:29,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:55:29,185 INFO L87 Difference]: Start difference. First operand 1218 states and 1397 transitions. Second operand has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:30,239 INFO L93 Difference]: Finished difference Result 1218 states and 1396 transitions. [2025-02-08 07:55:30,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:55:30,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 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 84 [2025-02-08 07:55:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:30,243 INFO L225 Difference]: With dead ends: 1218 [2025-02-08 07:55:30,243 INFO L226 Difference]: Without dead ends: 1218 [2025-02-08 07:55:30,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:55:30,244 INFO L435 NwaCegarLoop]: 1218 mSDtfsCounter, 5 mSDsluCounter, 3223 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:30,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4441 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:55:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-02-08 07:55:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1218. [2025-02-08 07:55:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 823 states have (on average 1.6622114216281896) internal successors, (1368), 1208 states have internal predecessors, (1368), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-08 07:55:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1396 transitions. [2025-02-08 07:55:30,259 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1396 transitions. Word has length 84 [2025-02-08 07:55:30,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:30,259 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1396 transitions. [2025-02-08 07:55:30,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.4) internal successors, (82), 6 states have internal predecessors, (82), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:30,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1396 transitions. [2025-02-08 07:55:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 07:55:30,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:30,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 07:55:30,260 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr529REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:30,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash -2020048759, now seen corresponding path program 1 times [2025-02-08 07:55:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124906632] [2025-02-08 07:55:30,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:30,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:55:30,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:55:30,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:30,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:30,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:30,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124906632] [2025-02-08 07:55:30,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124906632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:55:30,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063530577] [2025-02-08 07:55:30,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:30,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:55:30,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:55:30,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:55:30,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 07:55:30,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:55:30,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:55:30,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:30,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:30,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-08 07:55:30,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:55:30,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:55:30,916 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:55:30,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:55:30,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:55:30,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:55:30,981 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:55:31,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:55:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:31,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:55:31,055 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-08 07:55:31,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 21 treesize of output 20 [2025-02-08 07:55:31,069 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-08 07:55:31,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063530577] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:55:31,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:55:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2025-02-08 07:55:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190760375] [2025-02-08 07:55:31,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:55:31,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:55:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:31,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:55:31,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=151, Unknown=1, NotChecked=24, Total=210 [2025-02-08 07:55:31,072 INFO L87 Difference]: Start difference. First operand 1218 states and 1396 transitions. Second operand has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:55:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:33,600 INFO L93 Difference]: Finished difference Result 1217 states and 1395 transitions. [2025-02-08 07:55:33,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:55:33,600 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2025-02-08 07:55:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:33,603 INFO L225 Difference]: With dead ends: 1217 [2025-02-08 07:55:33,603 INFO L226 Difference]: Without dead ends: 1217 [2025-02-08 07:55:33,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=342, Unknown=1, NotChecked=38, Total=462 [2025-02-08 07:55:33,604 INFO L435 NwaCegarLoop]: 738 mSDtfsCounter, 1174 mSDsluCounter, 6393 mSDsCounter, 0 mSdLazyCounter, 5442 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 7131 SdHoareTripleChecker+Invalid, 5473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:33,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 7131 Invalid, 5473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5442 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-08 07:55:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2025-02-08 07:55:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2025-02-08 07:55:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 823 states have (on average 1.660996354799514) internal successors, (1367), 1207 states have internal predecessors, (1367), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2025-02-08 07:55:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1395 transitions. [2025-02-08 07:55:33,617 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1395 transitions. Word has length 85 [2025-02-08 07:55:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:33,618 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1395 transitions. [2025-02-08 07:55:33,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.083333333333334) internal successors, (121), 13 states have internal predecessors, (121), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:55:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1395 transitions. [2025-02-08 07:55:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 07:55:33,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:33,618 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:33,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 07:55:33,823 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,SelfDestructingSolverStorable15 [2025-02-08 07:55:33,823 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:33,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:33,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2020048758, now seen corresponding path program 1 times [2025-02-08 07:55:33,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:33,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015910308] [2025-02-08 07:55:33,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:33,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:33,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:55:33,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:55:33,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:33,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:34,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:34,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:34,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015910308] [2025-02-08 07:55:34,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015910308] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:55:34,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060411558] [2025-02-08 07:55:34,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:34,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:55:34,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:55:34,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:55:34,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 07:55:34,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:55:34,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:55:34,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:34,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:34,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 07:55:34,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:55:34,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:55:34,640 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:55:34,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:55:34,647 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 8 treesize of output 1 [2025-02-08 07:55:34,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:55:34,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:55:34,723 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 22 treesize of output 10 [2025-02-08 07:55:34,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:55:34,800 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:55:34,800 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:55:34,804 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 30 treesize of output 13 [2025-02-08 07:55:34,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:55:34,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:55:34,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:34,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:55:34,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_633 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_633 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_633) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2025-02-08 07:55:34,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060411558] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:55:34,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:55:34,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2025-02-08 07:55:34,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219916598] [2025-02-08 07:55:34,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:55:34,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:55:34,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:34,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:55:34,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-08 07:55:34,899 INFO L87 Difference]: Start difference. First operand 1217 states and 1395 transitions. Second operand has 15 states, 12 states have (on average 10.583333333333334) internal successors, (127), 15 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:55:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:36,944 INFO L93 Difference]: Finished difference Result 1224 states and 1402 transitions. [2025-02-08 07:55:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:55:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.583333333333334) internal successors, (127), 15 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2025-02-08 07:55:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:36,950 INFO L225 Difference]: With dead ends: 1224 [2025-02-08 07:55:36,950 INFO L226 Difference]: Without dead ends: 1224 [2025-02-08 07:55:36,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-02-08 07:55:36,954 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 1169 mSDsluCounter, 4272 mSDsCounter, 0 mSdLazyCounter, 5024 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 5015 SdHoareTripleChecker+Invalid, 5073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 5024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:36,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 5015 Invalid, 5073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 5024 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-08 07:55:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-02-08 07:55:36,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1215. [2025-02-08 07:55:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 822 states have (on average 1.6605839416058394) internal successors, (1365), 1205 states have internal predecessors, (1365), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1387 transitions. [2025-02-08 07:55:36,970 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1387 transitions. Word has length 85 [2025-02-08 07:55:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:36,970 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1387 transitions. [2025-02-08 07:55:36,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.583333333333334) internal successors, (127), 15 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:55:36,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1387 transitions. [2025-02-08 07:55:36,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 07:55:36,974 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:36,974 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:36,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 07:55:37,175 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,SelfDestructingSolverStorable16 [2025-02-08 07:55:37,175 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:37,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:37,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1195200767, now seen corresponding path program 1 times [2025-02-08 07:55:37,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:37,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118207062] [2025-02-08 07:55:37,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:37,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 07:55:37,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 07:55:37,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:37,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:37,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:37,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:37,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118207062] [2025-02-08 07:55:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118207062] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:37,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:37,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 07:55:37,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726434248] [2025-02-08 07:55:37,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:37,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:55:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:37,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:55:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:55:37,493 INFO L87 Difference]: Start difference. First operand 1215 states and 1387 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:39,261 INFO L93 Difference]: Finished difference Result 1228 states and 1406 transitions. [2025-02-08 07:55:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:55:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-02-08 07:55:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:39,264 INFO L225 Difference]: With dead ends: 1228 [2025-02-08 07:55:39,264 INFO L226 Difference]: Without dead ends: 1228 [2025-02-08 07:55:39,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-08 07:55:39,265 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 1198 mSDsluCounter, 4962 mSDsCounter, 0 mSdLazyCounter, 4355 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 5699 SdHoareTripleChecker+Invalid, 4386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:39,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 5699 Invalid, 4386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4355 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 07:55:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-02-08 07:55:39,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1224. [2025-02-08 07:55:39,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 830 states have (on average 1.6566265060240963) internal successors, (1375), 1213 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:55:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1398 transitions. [2025-02-08 07:55:39,277 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1398 transitions. Word has length 87 [2025-02-08 07:55:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:39,277 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1398 transitions. [2025-02-08 07:55:39,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 13 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1398 transitions. [2025-02-08 07:55:39,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 07:55:39,277 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:39,278 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:39,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 07:55:39,278 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:39,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:39,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1195200768, now seen corresponding path program 1 times [2025-02-08 07:55:39,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:39,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978296016] [2025-02-08 07:55:39,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:39,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:39,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 07:55:39,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 07:55:39,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:39,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:39,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-08 07:55:39,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:39,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978296016] [2025-02-08 07:55:39,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978296016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:39,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:39,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:55:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120812921] [2025-02-08 07:55:39,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:39,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:55:39,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:39,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:55:39,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:55:39,673 INFO L87 Difference]: Start difference. First operand 1224 states and 1398 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:41,654 INFO L93 Difference]: Finished difference Result 1227 states and 1405 transitions. [2025-02-08 07:55:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 07:55:41,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2025-02-08 07:55:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:41,657 INFO L225 Difference]: With dead ends: 1227 [2025-02-08 07:55:41,657 INFO L226 Difference]: Without dead ends: 1227 [2025-02-08 07:55:41,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:55:41,660 INFO L435 NwaCegarLoop]: 744 mSDtfsCounter, 1174 mSDsluCounter, 4275 mSDsCounter, 0 mSdLazyCounter, 5039 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 5068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:41,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 5019 Invalid, 5068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5039 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 07:55:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-02-08 07:55:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2025-02-08 07:55:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 830 states have (on average 1.655421686746988) internal successors, (1374), 1213 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:55:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1397 transitions. [2025-02-08 07:55:41,679 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1397 transitions. Word has length 87 [2025-02-08 07:55:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:41,679 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1397 transitions. [2025-02-08 07:55:41,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 11 states have internal predecessors, (85), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1397 transitions. [2025-02-08 07:55:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 07:55:41,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:41,680 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:41,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 07:55:41,681 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:41,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:41,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1810497739, now seen corresponding path program 1 times [2025-02-08 07:55:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:41,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015795933] [2025-02-08 07:55:41,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:41,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:41,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:55:41,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:55:41,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:41,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:42,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:42,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:42,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015795933] [2025-02-08 07:55:42,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015795933] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:55:42,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674403915] [2025-02-08 07:55:42,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:42,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:55:42,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:55:42,041 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:55:42,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 07:55:42,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:55:42,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:55:42,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:42,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:42,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 07:55:42,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:55:42,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:55:42,396 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:55:42,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:55:42,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:55:42,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:55:42,551 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:55:42,552 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:55:42,555 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 30 treesize of output 13 [2025-02-08 07:55:42,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 07:55:42,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:55:42,622 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 35 treesize of output 28 [2025-02-08 07:55:42,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:55:42,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:55:42,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 16 [2025-02-08 07:55:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:42,691 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:55:43,699 INFO L349 Elim1Store]: treesize reduction 5, result has 83.3 percent of original size [2025-02-08 07:55:43,699 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 34 treesize of output 33 [2025-02-08 07:55:43,715 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~mem52#1.offset_11| Int) (v_ArrVal_890 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.base| Int) (v_ArrVal_891 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem52#1.offset_11| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_890))) (store .cse1 |ULTIMATE.start_main_#t~mem52#1.base| (store (select .cse1 |ULTIMATE.start_main_#t~mem52#1.base|) (+ |v_ULTIMATE.start_main_#t~mem52#1.offset_11| 16) |c_ULTIMATE.start_main_~user~0#1.base|))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) |c_ULTIMATE.start_main_#t~mem50#1.base|)))) is different from false [2025-02-08 07:55:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674403915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:55:43,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:55:43,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2025-02-08 07:55:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820904211] [2025-02-08 07:55:43,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:55:43,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 07:55:43,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:43,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 07:55:43,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=617, Unknown=1, NotChecked=50, Total=756 [2025-02-08 07:55:43,719 INFO L87 Difference]: Start difference. First operand 1224 states and 1397 transitions. Second operand has 25 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 23 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:55:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:47,917 INFO L93 Difference]: Finished difference Result 1779 states and 2046 transitions. [2025-02-08 07:55:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:55:47,918 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 23 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2025-02-08 07:55:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:47,921 INFO L225 Difference]: With dead ends: 1779 [2025-02-08 07:55:47,921 INFO L226 Difference]: Without dead ends: 1779 [2025-02-08 07:55:47,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=188, Invalid=1075, Unknown=1, NotChecked=68, Total=1332 [2025-02-08 07:55:47,922 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 2809 mSDsluCounter, 11110 mSDsCounter, 0 mSdLazyCounter, 9005 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2825 SdHoareTripleChecker+Valid, 11847 SdHoareTripleChecker+Invalid, 9065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 9005 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:47,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2825 Valid, 11847 Invalid, 9065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 9005 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2025-02-08 07:55:47,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2025-02-08 07:55:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1223. [2025-02-08 07:55:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 830 states have (on average 1.6542168674698796) internal successors, (1373), 1212 states have internal predecessors, (1373), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:55:47,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1396 transitions. [2025-02-08 07:55:47,934 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1396 transitions. Word has length 88 [2025-02-08 07:55:47,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:47,934 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1396 transitions. [2025-02-08 07:55:47,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 23 states have internal predecessors, (170), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:55:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1396 transitions. [2025-02-08 07:55:47,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 07:55:47,935 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:47,935 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:47,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 07:55:48,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:55:48,139 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:48,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:48,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1810497740, now seen corresponding path program 1 times [2025-02-08 07:55:48,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:48,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731906935] [2025-02-08 07:55:48,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:48,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:48,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:55:48,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:55:48,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:48,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:48,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731906935] [2025-02-08 07:55:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731906935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:55:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581822865] [2025-02-08 07:55:48,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:48,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:55:48,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:55:48,626 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:55:48,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 07:55:48,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:55:48,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:55:48,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:48,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:48,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 07:55:48,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:55:48,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:55:48,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:55:48,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:55:48,931 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 8 treesize of output 1 [2025-02-08 07:55:48,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:55:48,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:55:49,040 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 22 treesize of output 10 [2025-02-08 07:55:49,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:55:49,130 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:55:49,130 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:55:49,136 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 30 treesize of output 13 [2025-02-08 07:55:49,208 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:55:49,208 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:55:49,217 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 30 treesize of output 13 [2025-02-08 07:55:49,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:55:49,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:55:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:49,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:55:49,311 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1028 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:55:49,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1034))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) .cse0 v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (v_ArrVal_1034 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1035) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1034) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1028) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2025-02-08 07:55:49,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581822865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:55:49,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:55:49,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-08 07:55:49,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887238395] [2025-02-08 07:55:49,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:55:49,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 07:55:49,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:49,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 07:55:49,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=425, Unknown=10, NotChecked=86, Total=600 [2025-02-08 07:55:49,422 INFO L87 Difference]: Start difference. First operand 1223 states and 1396 transitions. Second operand has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 20 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:55:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:53,926 INFO L93 Difference]: Finished difference Result 1225 states and 1403 transitions. [2025-02-08 07:55:53,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:55:53,927 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 20 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 88 [2025-02-08 07:55:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:53,929 INFO L225 Difference]: With dead ends: 1225 [2025-02-08 07:55:53,929 INFO L226 Difference]: Without dead ends: 1225 [2025-02-08 07:55:53,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=628, Unknown=10, NotChecked=106, Total=870 [2025-02-08 07:55:53,930 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 1164 mSDsluCounter, 7548 mSDsCounter, 0 mSdLazyCounter, 9322 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 8290 SdHoareTripleChecker+Invalid, 9355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 9322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:53,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 8290 Invalid, 9355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 9322 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-02-08 07:55:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2025-02-08 07:55:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1213. [2025-02-08 07:55:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 822 states have (on average 1.6581508515815084) internal successors, (1363), 1203 states have internal predecessors, (1363), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:55:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1385 transitions. [2025-02-08 07:55:53,942 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1385 transitions. Word has length 88 [2025-02-08 07:55:53,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:53,943 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1385 transitions. [2025-02-08 07:55:53,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.176470588235293) internal successors, (139), 20 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:55:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1385 transitions. [2025-02-08 07:55:53,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 07:55:53,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:53,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:53,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 07:55:54,148 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,SelfDestructingSolverStorable20 [2025-02-08 07:55:54,148 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:54,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash 948484462, now seen corresponding path program 1 times [2025-02-08 07:55:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:54,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86318440] [2025-02-08 07:55:54,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:54,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:54,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 07:55:54,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 07:55:54,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:54,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:54,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:54,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86318440] [2025-02-08 07:55:54,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86318440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:54,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:54,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 07:55:54,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290600230] [2025-02-08 07:55:54,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:54,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:55:54,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:54,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:55:54,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:55:54,479 INFO L87 Difference]: Start difference. First operand 1213 states and 1385 transitions. Second operand has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:56,476 INFO L93 Difference]: Finished difference Result 1229 states and 1407 transitions. [2025-02-08 07:55:56,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:55:56,477 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 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 90 [2025-02-08 07:55:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:56,482 INFO L225 Difference]: With dead ends: 1229 [2025-02-08 07:55:56,482 INFO L226 Difference]: Without dead ends: 1229 [2025-02-08 07:55:56,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2025-02-08 07:55:56,484 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 1197 mSDsluCounter, 4986 mSDsCounter, 0 mSdLazyCounter, 4396 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 5722 SdHoareTripleChecker+Invalid, 4427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:56,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 5722 Invalid, 4427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4396 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-08 07:55:56,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2025-02-08 07:55:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1225. [2025-02-08 07:55:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 833 states have (on average 1.6518607442977191) internal successors, (1376), 1214 states have internal predecessors, (1376), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:55:56,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1399 transitions. [2025-02-08 07:55:56,494 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1399 transitions. Word has length 90 [2025-02-08 07:55:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:56,494 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1399 transitions. [2025-02-08 07:55:56,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.769230769230769) internal successors, (88), 14 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1399 transitions. [2025-02-08 07:55:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 07:55:56,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:56,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:56,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 07:55:56,495 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:56,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:56,496 INFO L85 PathProgramCache]: Analyzing trace with hash 948484463, now seen corresponding path program 1 times [2025-02-08 07:55:56,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:56,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948517419] [2025-02-08 07:55:56,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:56,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:55:56,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 07:55:56,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 07:55:56,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:55:56,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:55:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:55:57,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:55:57,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948517419] [2025-02-08 07:55:57,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948517419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:55:57,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:55:57,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 07:55:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580627926] [2025-02-08 07:55:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:55:57,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 07:55:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:55:57,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 07:55:57,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 07:55:57,096 INFO L87 Difference]: Start difference. First operand 1225 states and 1399 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:55:59,982 INFO L93 Difference]: Finished difference Result 1228 states and 1406 transitions. [2025-02-08 07:55:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:55:59,983 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 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 90 [2025-02-08 07:55:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:55:59,985 INFO L225 Difference]: With dead ends: 1228 [2025-02-08 07:55:59,985 INFO L226 Difference]: Without dead ends: 1228 [2025-02-08 07:55:59,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:55:59,986 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 1191 mSDsluCounter, 4670 mSDsCounter, 0 mSdLazyCounter, 5914 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 5413 SdHoareTripleChecker+Invalid, 5943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:55:59,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 5413 Invalid, 5943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5914 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-08 07:55:59,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-02-08 07:55:59,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2025-02-08 07:55:59,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 833 states have (on average 1.6506602641056423) internal successors, (1375), 1214 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:55:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1398 transitions. [2025-02-08 07:55:59,996 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1398 transitions. Word has length 90 [2025-02-08 07:55:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:55:59,996 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1398 transitions. [2025-02-08 07:55:59,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 12 states have internal predecessors, (88), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:55:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1398 transitions. [2025-02-08 07:55:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 07:55:59,997 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:55:59,997 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:55:59,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 07:55:59,997 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:55:59,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:55:59,998 INFO L85 PathProgramCache]: Analyzing trace with hash 340157986, now seen corresponding path program 1 times [2025-02-08 07:55:59,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:55:59,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550735585] [2025-02-08 07:55:59,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:55:59,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:56:00,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:56:00,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:56:00,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:00,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:00,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:56:00,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550735585] [2025-02-08 07:56:00,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550735585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:00,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884092920] [2025-02-08 07:56:00,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:00,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:56:00,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:56:00,483 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:56:00,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 07:56:00,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:56:00,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:56:00,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:00,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:00,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 07:56:00,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:56:00,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:56:00,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:56:00,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:56:00,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:56:00,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:00,837 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:00,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:00,874 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:00,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:00,932 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:00,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:56:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:00,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:56:00,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 07:56:00,981 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1308))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1309)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:56:05,100 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-02-08 07:56:05,100 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 57 treesize of output 56 [2025-02-08 07:56:05,110 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1312 (Array Int Int)) (v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1312))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1308)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1309)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-08 07:56:05,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884092920] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:05,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:56:05,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-02-08 07:56:05,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509098695] [2025-02-08 07:56:05,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:56:05,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 07:56:05,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:56:05,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 07:56:05,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=12, NotChecked=120, Total=552 [2025-02-08 07:56:05,113 INFO L87 Difference]: Start difference. First operand 1225 states and 1398 transitions. Second operand has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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-08 07:56:08,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:56:08,294 INFO L93 Difference]: Finished difference Result 1227 states and 1405 transitions. [2025-02-08 07:56:08,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:56:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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 91 [2025-02-08 07:56:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:56:08,297 INFO L225 Difference]: With dead ends: 1227 [2025-02-08 07:56:08,297 INFO L226 Difference]: Without dead ends: 1227 [2025-02-08 07:56:08,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=12, NotChecked=168, Total=992 [2025-02-08 07:56:08,299 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 1162 mSDsluCounter, 7128 mSDsCounter, 0 mSdLazyCounter, 5965 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 7864 SdHoareTripleChecker+Invalid, 5995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:56:08,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 7864 Invalid, 5995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5965 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-08 07:56:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-02-08 07:56:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2025-02-08 07:56:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 833 states have (on average 1.6494597839135654) internal successors, (1374), 1213 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:56:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1397 transitions. [2025-02-08 07:56:08,326 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1397 transitions. Word has length 91 [2025-02-08 07:56:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:56:08,327 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1397 transitions. [2025-02-08 07:56:08,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 8.058823529411764) internal successors, (137), 19 states have internal predecessors, (137), 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-08 07:56:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1397 transitions. [2025-02-08 07:56:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 07:56:08,327 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:56:08,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:56:08,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 07:56:08,528 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,SelfDestructingSolverStorable23 [2025-02-08 07:56:08,528 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:56:08,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:56:08,529 INFO L85 PathProgramCache]: Analyzing trace with hash 340157987, now seen corresponding path program 1 times [2025-02-08 07:56:08,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:56:08,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938485715] [2025-02-08 07:56:08,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:08,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:56:08,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:56:08,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:56:08,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:08,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:09,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:56:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938485715] [2025-02-08 07:56:09,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938485715] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:09,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317340384] [2025-02-08 07:56:09,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:09,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:56:09,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:56:09,114 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:56:09,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 07:56:09,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:56:09,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:56:09,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:09,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:09,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-08 07:56:09,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:56:09,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:56:09,413 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:56:09,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:56:09,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:56:09,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:09,509 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-02-08 07:56:09,554 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-02-08 07:56:09,554 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 41 [2025-02-08 07:56:09,559 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 30 treesize of output 13 [2025-02-08 07:56:09,682 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 07:56:09,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 66 [2025-02-08 07:56:09,688 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 41 treesize of output 22 [2025-02-08 07:56:09,692 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 3 [2025-02-08 07:56:09,737 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 39 treesize of output 21 [2025-02-08 07:56:09,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2025-02-08 07:56:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:09,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:56:09,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 07:56:09,941 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 112 treesize of output 116 [2025-02-08 07:56:10,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base|) (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1457 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1457))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< 0 (+ 9 (select (select (store .cse0 .cse2 v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1457 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1457))) (or (< (+ (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< (select (select (store .cse3 .cse2 v_ArrVal_1460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 9))))) (or (forall ((v_ArrVal_1459 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem52#1.base| (select (select (store .cse4 .cse2 v_ArrVal_1459) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1457 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1457) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0)) (forall ((v_ArrVal_1457 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1457))) (or (< (+ (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_prenex_6 (Array Int Int))) (<= 0 (+ (select (select (store .cse5 .cse2 v_prenex_6) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))))))))) is different from false [2025-02-08 07:56:10,069 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 992 treesize of output 938 [2025-02-08 07:56:10,088 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 710 treesize of output 702 [2025-02-08 07:56:10,102 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 702 treesize of output 694 [2025-02-08 07:56:10,112 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 694 treesize of output 690 [2025-02-08 07:56:10,126 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 690 treesize of output 682 [2025-02-08 07:56:10,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 682 treesize of output 674 [2025-02-08 07:56:10,148 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 674 treesize of output 666 [2025-02-08 07:56:10,157 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 666 treesize of output 658 [2025-02-08 07:56:10,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317340384] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:10,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:56:10,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2025-02-08 07:56:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200814527] [2025-02-08 07:56:10,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:56:10,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 07:56:10,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:56:10,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 07:56:10,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=700, Unknown=13, NotChecked=54, Total=870 [2025-02-08 07:56:10,451 INFO L87 Difference]: Start difference. First operand 1224 states and 1397 transitions. Second operand has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 24 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:56:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:56:15,536 INFO L93 Difference]: Finished difference Result 1226 states and 1404 transitions. [2025-02-08 07:56:15,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:56:15,537 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 24 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 91 [2025-02-08 07:56:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:56:15,547 INFO L225 Difference]: With dead ends: 1226 [2025-02-08 07:56:15,548 INFO L226 Difference]: Without dead ends: 1226 [2025-02-08 07:56:15,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=1068, Unknown=13, NotChecked=68, Total=1332 [2025-02-08 07:56:15,549 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 1166 mSDsluCounter, 7365 mSDsCounter, 0 mSdLazyCounter, 8202 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 8107 SdHoareTripleChecker+Invalid, 8252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 8202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:56:15,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 8107 Invalid, 8252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 8202 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-02-08 07:56:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-02-08 07:56:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1211. [2025-02-08 07:56:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 822 states have (on average 1.6557177615571776) internal successors, (1361), 1201 states have internal predecessors, (1361), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:56:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1383 transitions. [2025-02-08 07:56:15,563 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1383 transitions. Word has length 91 [2025-02-08 07:56:15,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:56:15,564 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1383 transitions. [2025-02-08 07:56:15,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.904761904761905) internal successors, (145), 24 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:56:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1383 transitions. [2025-02-08 07:56:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:56:15,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:56:15,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:56:15,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 07:56:15,766 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,SelfDestructingSolverStorable24 [2025-02-08 07:56:15,767 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:56:15,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:56:15,767 INFO L85 PathProgramCache]: Analyzing trace with hash -287921288, now seen corresponding path program 1 times [2025-02-08 07:56:15,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:56:15,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041334650] [2025-02-08 07:56:15,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:56:15,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:56:15,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:56:15,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:15,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:16,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:56:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041334650] [2025-02-08 07:56:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041334650] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:56:16,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:56:16,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 07:56:16,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359350066] [2025-02-08 07:56:16,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:56:16,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 07:56:16,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:56:16,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 07:56:16,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:56:16,351 INFO L87 Difference]: Start difference. First operand 1211 states and 1383 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:56:19,503 INFO L93 Difference]: Finished difference Result 1230 states and 1408 transitions. [2025-02-08 07:56:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:56:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 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 93 [2025-02-08 07:56:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:56:19,505 INFO L225 Difference]: With dead ends: 1230 [2025-02-08 07:56:19,505 INFO L226 Difference]: Without dead ends: 1230 [2025-02-08 07:56:19,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:56:19,506 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 1183 mSDsluCounter, 7083 mSDsCounter, 0 mSdLazyCounter, 6006 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 7818 SdHoareTripleChecker+Invalid, 6037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 6006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:56:19,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 7818 Invalid, 6037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 6006 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-08 07:56:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2025-02-08 07:56:19,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1226. [2025-02-08 07:56:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 836 states have (on average 1.6471291866028708) internal successors, (1377), 1215 states have internal predecessors, (1377), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:56:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1400 transitions. [2025-02-08 07:56:19,514 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1400 transitions. Word has length 93 [2025-02-08 07:56:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:56:19,514 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1400 transitions. [2025-02-08 07:56:19,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 15 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:19,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1400 transitions. [2025-02-08 07:56:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:56:19,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:56:19,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:56:19,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 07:56:19,516 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:56:19,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:56:19,516 INFO L85 PathProgramCache]: Analyzing trace with hash -287921287, now seen corresponding path program 1 times [2025-02-08 07:56:19,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:56:19,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139288495] [2025-02-08 07:56:19,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:19,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:56:19,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:56:19,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:56:19,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:19,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:20,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:56:20,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139288495] [2025-02-08 07:56:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139288495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:56:20,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:56:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 07:56:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512678257] [2025-02-08 07:56:20,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:56:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:56:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:56:20,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:56:20,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:56:20,058 INFO L87 Difference]: Start difference. First operand 1226 states and 1400 transitions. Second operand has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:56:23,329 INFO L93 Difference]: Finished difference Result 1229 states and 1407 transitions. [2025-02-08 07:56:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:56:23,329 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 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 93 [2025-02-08 07:56:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:56:23,331 INFO L225 Difference]: With dead ends: 1229 [2025-02-08 07:56:23,331 INFO L226 Difference]: Without dead ends: 1229 [2025-02-08 07:56:23,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2025-02-08 07:56:23,331 INFO L435 NwaCegarLoop]: 742 mSDtfsCounter, 1193 mSDsluCounter, 4134 mSDsCounter, 0 mSdLazyCounter, 5195 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 4876 SdHoareTripleChecker+Invalid, 5224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:56:23,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 4876 Invalid, 5224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5195 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-08 07:56:23,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2025-02-08 07:56:23,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1226. [2025-02-08 07:56:23,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 836 states have (on average 1.645933014354067) internal successors, (1376), 1215 states have internal predecessors, (1376), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:56:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1399 transitions. [2025-02-08 07:56:23,339 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1399 transitions. Word has length 93 [2025-02-08 07:56:23,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:56:23,339 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1399 transitions. [2025-02-08 07:56:23,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:23,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1399 transitions. [2025-02-08 07:56:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:56:23,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:56:23,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:56:23,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-08 07:56:23,340 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:56:23,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:56:23,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1820021316, now seen corresponding path program 1 times [2025-02-08 07:56:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:56:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464327212] [2025-02-08 07:56:23,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:56:23,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:56:23,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:56:23,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:23,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:23,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:23,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:56:23,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464327212] [2025-02-08 07:56:23,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464327212] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:23,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194867081] [2025-02-08 07:56:23,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:23,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:56:23,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:56:23,836 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:56:23,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 07:56:24,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:56:24,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:56:24,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:24,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:24,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 07:56:24,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:56:24,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:56:24,175 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:56:24,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:56:24,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:56:24,218 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:24,218 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-02-08 07:56:24,243 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:24,244 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2025-02-08 07:56:24,279 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:24,279 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:24,322 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:24,323 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:24,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:56:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:24,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:56:24,347 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1762 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1762) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 07:56:24,385 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-08 07:56:24,385 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 33 treesize of output 32 [2025-02-08 07:56:24,391 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1761 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1761))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1762)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem53#1.base|)) is different from false [2025-02-08 07:56:24,397 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1761 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1761))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1762)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse2)))) is different from false [2025-02-08 07:56:24,453 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1760))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_1761))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1762)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2025-02-08 07:56:24,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1765 (Array Int Int)) (v_ArrVal_1762 (Array Int Int)) (v_ArrVal_1761 (Array Int Int)) (v_ArrVal_1760 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1765))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1760)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_1761))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1762)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2025-02-08 07:56:24,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194867081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:24,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:56:24,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2025-02-08 07:56:24,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454864594] [2025-02-08 07:56:24,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:56:24,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 07:56:24,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:56:24,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 07:56:24,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=316, Unknown=17, NotChecked=200, Total=600 [2025-02-08 07:56:24,484 INFO L87 Difference]: Start difference. First operand 1226 states and 1399 transitions. Second operand has 18 states, 16 states have (on average 8.5) internal successors, (136), 18 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:27,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:56:27,096 INFO L93 Difference]: Finished difference Result 1228 states and 1406 transitions. [2025-02-08 07:56:27,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:56:27,097 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 18 states have internal predecessors, (136), 1 states have call successors, (1), 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 94 [2025-02-08 07:56:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:56:27,098 INFO L225 Difference]: With dead ends: 1228 [2025-02-08 07:56:27,098 INFO L226 Difference]: Without dead ends: 1228 [2025-02-08 07:56:27,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=630, Unknown=18, NotChecked=280, Total=1056 [2025-02-08 07:56:27,099 INFO L435 NwaCegarLoop]: 741 mSDtfsCounter, 1166 mSDsluCounter, 4985 mSDsCounter, 0 mSdLazyCounter, 4355 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 5726 SdHoareTripleChecker+Invalid, 4400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:56:27,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 5726 Invalid, 4400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4355 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-08 07:56:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-02-08 07:56:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2025-02-08 07:56:27,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 836 states have (on average 1.644736842105263) internal successors, (1375), 1214 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:56:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1398 transitions. [2025-02-08 07:56:27,108 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1398 transitions. Word has length 94 [2025-02-08 07:56:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:56:27,108 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1398 transitions. [2025-02-08 07:56:27,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.5) internal successors, (136), 18 states have internal predecessors, (136), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1398 transitions. [2025-02-08 07:56:27,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:56:27,108 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:56:27,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:56:27,116 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-08 07:56:27,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:56:27,313 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:56:27,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:56:27,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1820021317, now seen corresponding path program 1 times [2025-02-08 07:56:27,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:56:27,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244178830] [2025-02-08 07:56:27,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:27,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:56:27,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:56:27,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:56:27,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:27,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:27,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:56:27,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244178830] [2025-02-08 07:56:27,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244178830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:27,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643409293] [2025-02-08 07:56:27,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:27,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:56:27,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:56:27,879 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:56:27,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 07:56:28,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:56:28,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:56:28,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:28,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:28,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-08 07:56:28,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:56:28,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:56:28,273 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:56:28,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:56:28,281 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 8 treesize of output 1 [2025-02-08 07:56:28,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:56:28,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 07:56:28,460 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 22 treesize of output 10 [2025-02-08 07:56:28,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:56:28,614 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:28,614 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:56:28,621 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 30 treesize of output 13 [2025-02-08 07:56:28,737 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:28,737 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:56:28,744 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 30 treesize of output 13 [2025-02-08 07:56:28,795 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:28,795 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:56:28,799 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 30 treesize of output 13 [2025-02-08 07:56:28,862 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:28,862 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2025-02-08 07:56:28,871 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 30 treesize of output 13 [2025-02-08 07:56:28,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:56:28,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-02-08 07:56:28,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:28,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:56:29,071 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1931 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2025-02-08 07:56:29,083 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1931 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:56:29,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1929))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928) .cse0 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1928) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2025-02-08 07:56:29,126 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1929))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1928) .cse1 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1928) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2025-02-08 07:56:29,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1928) (select (select (store .cse1 .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1931))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1926))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1929))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1927) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 07:56:29,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1929))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1928) .cse2 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse6 v_ArrVal_1928) (select (select (store .cse7 .cse6 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1931))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2025-02-08 07:56:29,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1937))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936) .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1928) (select (select (store .cse2 .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1931))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1931 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1937))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1926))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1929))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ 24 (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1936) .cse5 v_ArrVal_1927) .cse6 v_ArrVal_1928) .cse7 v_ArrVal_1931) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1930) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2025-02-08 07:56:29,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643409293] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:29,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:56:29,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2025-02-08 07:56:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793502450] [2025-02-08 07:56:29,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:56:29,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 07:56:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:56:29,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 07:56:29,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=569, Unknown=7, NotChecked=378, Total=1056 [2025-02-08 07:56:29,221 INFO L87 Difference]: Start difference. First operand 1225 states and 1398 transitions. Second operand has 24 states, 21 states have (on average 7.190476190476191) internal successors, (151), 24 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:56:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:56:33,965 INFO L93 Difference]: Finished difference Result 1227 states and 1405 transitions. [2025-02-08 07:56:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:56:33,965 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.190476190476191) internal successors, (151), 24 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 94 [2025-02-08 07:56:33,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:56:33,967 INFO L225 Difference]: With dead ends: 1227 [2025-02-08 07:56:33,967 INFO L226 Difference]: Without dead ends: 1227 [2025-02-08 07:56:33,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=165, Invalid=912, Unknown=7, NotChecked=476, Total=1560 [2025-02-08 07:56:33,968 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 1164 mSDsluCounter, 7019 mSDsCounter, 0 mSdLazyCounter, 8583 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 7759 SdHoareTripleChecker+Invalid, 8615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 8583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:56:33,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 7759 Invalid, 8615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 8583 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-08 07:56:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-02-08 07:56:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1209. [2025-02-08 07:56:33,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 822 states have (on average 1.6532846715328466) internal successors, (1359), 1199 states have internal predecessors, (1359), 16 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 07:56:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1381 transitions. [2025-02-08 07:56:33,979 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1381 transitions. Word has length 94 [2025-02-08 07:56:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:56:33,980 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1381 transitions. [2025-02-08 07:56:33,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.190476190476191) internal successors, (151), 24 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 07:56:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1381 transitions. [2025-02-08 07:56:33,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:56:33,980 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:56:33,980 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:56:33,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 07:56:34,180 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,SelfDestructingSolverStorable28 [2025-02-08 07:56:34,181 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr513REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:56:34,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:56:34,181 INFO L85 PathProgramCache]: Analyzing trace with hash 109927474, now seen corresponding path program 1 times [2025-02-08 07:56:34,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:56:34,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712534195] [2025-02-08 07:56:34,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:34,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:56:34,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:56:34,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:56:34,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:34,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:34,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:34,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:56:34,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712534195] [2025-02-08 07:56:34,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712534195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:56:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:56:34,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 07:56:34,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514590780] [2025-02-08 07:56:34,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:56:34,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 07:56:34,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:56:34,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 07:56:34,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:56:34,685 INFO L87 Difference]: Start difference. First operand 1209 states and 1381 transitions. Second operand has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:37,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:56:37,664 INFO L93 Difference]: Finished difference Result 1232 states and 1410 transitions. [2025-02-08 07:56:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:56:37,664 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-02-08 07:56:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:56:37,667 INFO L225 Difference]: With dead ends: 1232 [2025-02-08 07:56:37,670 INFO L226 Difference]: Without dead ends: 1232 [2025-02-08 07:56:37,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-02-08 07:56:37,671 INFO L435 NwaCegarLoop]: 734 mSDtfsCounter, 1185 mSDsluCounter, 6374 mSDsCounter, 0 mSdLazyCounter, 5488 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 7108 SdHoareTripleChecker+Invalid, 5522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 5488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:56:37,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 7108 Invalid, 5522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 5488 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-08 07:56:37,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2025-02-08 07:56:37,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1228. [2025-02-08 07:56:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 840 states have (on average 1.6416666666666666) internal successors, (1379), 1217 states have internal predecessors, (1379), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:56:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1402 transitions. [2025-02-08 07:56:37,696 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1402 transitions. Word has length 97 [2025-02-08 07:56:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:56:37,696 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1402 transitions. [2025-02-08 07:56:37,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.333333333333333) internal successors, (95), 16 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1402 transitions. [2025-02-08 07:56:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:56:37,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:56:37,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:56:37,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 07:56:37,697 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:56:37,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:56:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash 109927475, now seen corresponding path program 1 times [2025-02-08 07:56:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:56:37,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50230762] [2025-02-08 07:56:37,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:56:37,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:56:37,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:56:37,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:37,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:56:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50230762] [2025-02-08 07:56:38,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50230762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:56:38,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:56:38,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 07:56:38,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625703370] [2025-02-08 07:56:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:56:38,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 07:56:38,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:56:38,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 07:56:38,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-08 07:56:38,642 INFO L87 Difference]: Start difference. First operand 1228 states and 1402 transitions. Second operand has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:42,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:56:42,485 INFO L93 Difference]: Finished difference Result 1231 states and 1409 transitions. [2025-02-08 07:56:42,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:56:42,485 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 97 [2025-02-08 07:56:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:56:42,487 INFO L225 Difference]: With dead ends: 1231 [2025-02-08 07:56:42,487 INFO L226 Difference]: Without dead ends: 1231 [2025-02-08 07:56:42,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-02-08 07:56:42,488 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 1194 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 6739 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 5883 SdHoareTripleChecker+Invalid, 6773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 6739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:56:42,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 5883 Invalid, 6773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 6739 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-08 07:56:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2025-02-08 07:56:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1228. [2025-02-08 07:56:42,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 840 states have (on average 1.6404761904761904) internal successors, (1378), 1217 states have internal predecessors, (1378), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2025-02-08 07:56:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1401 transitions. [2025-02-08 07:56:42,495 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1401 transitions. Word has length 97 [2025-02-08 07:56:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:56:42,495 INFO L471 AbstractCegarLoop]: Abstraction has 1228 states and 1401 transitions. [2025-02-08 07:56:42,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.9375) internal successors, (95), 17 states have internal predecessors, (95), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 07:56:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1401 transitions. [2025-02-08 07:56:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:56:42,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:56:42,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:56:42,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-08 07:56:42,496 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr513REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2025-02-08 07:56:42,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:56:42,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1084865790, now seen corresponding path program 1 times [2025-02-08 07:56:42,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:56:42,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538970912] [2025-02-08 07:56:42,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:56:42,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:56:42,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:56:42,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:42,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:43,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:43,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:56:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538970912] [2025-02-08 07:56:43,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538970912] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:43,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576552942] [2025-02-08 07:56:43,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:56:43,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:56:43,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:56:43,008 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:56:43,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 07:56:43,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:56:43,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:56:43,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:56:43,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:56:43,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 07:56:43,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:56:43,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:56:43,320 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:56:43,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 07:56:43,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 07:56:43,390 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:43,391 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:43,430 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:43,431 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:43,474 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:43,474 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:43,520 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:43,521 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:43,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:56:43,569 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 07:56:43,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:56:43,598 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 07:56:43,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 07:56:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 07:56:43,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:56:44,181 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-02-08 07:56:44,181 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 597 treesize of output 794 [2025-02-08 07:56:44,194 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2273 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2273))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2266)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2267)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2268)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2269)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-08 07:56:44,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576552942] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:56:44,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:56:44,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 22 [2025-02-08 07:56:44,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356299568] [2025-02-08 07:56:44,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:56:44,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 07:56:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:56:44,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 07:56:44,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=873, Unknown=42, NotChecked=62, Total=1122 [2025-02-08 07:56:44,197 INFO L87 Difference]: Start difference. First operand 1228 states and 1401 transitions. Second operand has 23 states, 21 states have (on average 7.0476190476190474) internal successors, (148), 23 states have internal predecessors, (148), 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)