./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-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_OAT_test1-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 ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 07:58:03,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 07:58:03,636 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:58:03,643 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 07:58:03,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 07:58:03,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 07:58:03,662 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 07:58:03,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 07:58:03,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 07:58:03,662 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 07:58:03,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 07:58:03,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 07:58:03,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 07:58:03,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 07:58:03,663 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 07:58:03,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 07:58:03,663 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 07:58:03,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 07:58:03,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 07:58:03,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 07:58:03,664 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 07:58:03,664 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 07:58:03,664 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 07:58:03,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 07:58:03,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 07:58:03,664 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 07:58:03,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 07:58:03,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 07:58:03,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 07:58:03,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 07:58:03,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 07:58:03,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 07:58:03,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 07:58:03,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:58:03,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 07:58:03,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 07:58:03,667 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 07:58:03,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 07:58:03,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 07:58:03,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 07:58:03,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 07:58:03,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 07:58:03,668 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 -> ec105877a5c5817dc7d6d5e780267dcadb379ad27281f7d8981115c8613ba085 [2025-02-08 07:58:03,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 07:58:03,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 07:58:03,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 07:58:03,966 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 07:58:03,966 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 07:58:03,967 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_OAT_test1-1.i [2025-02-08 07:58:05,207 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4545b12c5/61a3939fcb644cab8ccf77faa8910d23/FLAG55def0206 [2025-02-08 07:58:05,544 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 07:58:05,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test1-1.i [2025-02-08 07:58:05,565 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4545b12c5/61a3939fcb644cab8ccf77faa8910d23/FLAG55def0206 [2025-02-08 07:58:05,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4545b12c5/61a3939fcb644cab8ccf77faa8910d23 [2025-02-08 07:58:05,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 07:58:05,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 07:58:05,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 07:58:05,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 07:58:05,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 07:58:05,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:58:05" (1/1) ... [2025-02-08 07:58:05,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19a14da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:05, skipping insertion in model container [2025-02-08 07:58:05,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 07:58:05" (1/1) ... [2025-02-08 07:58:05,637 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 07:58:06,003 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:58:06,042 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:58:06,045 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:58:06,049 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:58:06,057 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:58:06,069 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:58:06,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:58:06,082 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 07:58:06,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 07:58:06,208 INFO L204 MainTranslator]: Completed translation [2025-02-08 07:58:06,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06 WrapperNode [2025-02-08 07:58:06,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 07:58:06,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 07:58:06,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 07:58:06,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 07:58:06,214 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:58:06" (1/1) ... [2025-02-08 07:58:06,233 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:58:06" (1/1) ... [2025-02-08 07:58:06,279 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 823 [2025-02-08 07:58:06,280 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 07:58:06,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 07:58:06,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 07:58:06,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 07:58:06,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,367 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-02-08 07:58:06,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 07:58:06,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 07:58:06,435 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 07:58:06,435 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 07:58:06,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (1/1) ... [2025-02-08 07:58:06,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 07:58:06,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:58:06,467 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:58:06,470 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:58:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 07:58:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 07:58:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 07:58:06,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 07:58:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 07:58:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 07:58:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 07:58:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 07:58:06,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 07:58:06,491 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 07:58:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 07:58:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 07:58:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 07:58:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 07:58:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 07:58:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 07:58:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 07:58:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 07:58:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 07:58:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 07:58:06,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 07:58:06,665 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 07:58:06,667 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 07:58:08,198 INFO L? ?]: Removed 774 outVars from TransFormulas that were not future-live. [2025-02-08 07:58:08,199 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 07:58:08,259 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 07:58:08,259 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 07:58:08,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:58:08 BoogieIcfgContainer [2025-02-08 07:58:08,260 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 07:58:08,262 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 07:58:08,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 07:58:08,265 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 07:58:08,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 07:58:05" (1/3) ... [2025-02-08 07:58:08,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d3ea24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:58:08, skipping insertion in model container [2025-02-08 07:58:08,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 07:58:06" (2/3) ... [2025-02-08 07:58:08,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d3ea24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 07:58:08, skipping insertion in model container [2025-02-08 07:58:08,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 07:58:08" (3/3) ... [2025-02-08 07:58:08,267 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test1-1.i [2025-02-08 07:58:08,279 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 07:58:08,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test1-1.i that has 4 procedures, 763 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2025-02-08 07:58:08,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 07:58:08,341 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;@1ae11c41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 07:58:08,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2025-02-08 07:58:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 758 states, 424 states have (on average 2.0542452830188678) internal successors, (871), 751 states have internal predecessors, (871), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-08 07:58:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:58:08,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:08,350 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:58:08,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:08,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash 29551613, now seen corresponding path program 1 times [2025-02-08 07:58:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:08,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681178822] [2025-02-08 07:58:08,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:08,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:58:08,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:58:08,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:08,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:08,542 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:58:08,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:08,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681178822] [2025-02-08 07:58:08,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681178822] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:08,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:08,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:58:08,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564585498] [2025-02-08 07:58:08,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:08,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:58:08,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:08,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:58:08,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:58:08,576 INFO L87 Difference]: Start difference. First operand has 758 states, 424 states have (on average 2.0542452830188678) internal successors, (871), 751 states have internal predecessors, (871), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) 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:58:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:09,223 INFO L93 Difference]: Finished difference Result 700 states and 807 transitions. [2025-02-08 07:58:09,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:58:09,225 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:58:09,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:09,239 INFO L225 Difference]: With dead ends: 700 [2025-02-08 07:58:09,239 INFO L226 Difference]: Without dead ends: 695 [2025-02-08 07:58:09,241 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:58:09,243 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 698 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:09,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 484 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:58:09,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-02-08 07:58:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 694. [2025-02-08 07:58:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 417 states have (on average 1.8585131894484412) internal successors, (775), 688 states have internal predecessors, (775), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 791 transitions. [2025-02-08 07:58:09,305 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 791 transitions. Word has length 4 [2025-02-08 07:58:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:09,306 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 791 transitions. [2025-02-08 07:58:09,306 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:58:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 791 transitions. [2025-02-08 07:58:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:58:09,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:09,307 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:58:09,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 07:58:09,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr318REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:09,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:09,308 INFO L85 PathProgramCache]: Analyzing trace with hash 29551614, now seen corresponding path program 1 times [2025-02-08 07:58:09,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:09,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642447575] [2025-02-08 07:58:09,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:09,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:09,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:58:09,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:58:09,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:09,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:09,433 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:58:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642447575] [2025-02-08 07:58:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642447575] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:09,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:09,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:58:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754652128] [2025-02-08 07:58:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:09,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:58:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:09,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:58:09,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:58:09,436 INFO L87 Difference]: Start difference. First operand 694 states and 791 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:58:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:09,895 INFO L93 Difference]: Finished difference Result 678 states and 776 transitions. [2025-02-08 07:58:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:58:09,896 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:58:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:09,899 INFO L225 Difference]: With dead ends: 678 [2025-02-08 07:58:09,899 INFO L226 Difference]: Without dead ends: 678 [2025-02-08 07:58:09,899 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:58:09,900 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 466 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:09,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 745 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 07:58:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-08 07:58:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 669. [2025-02-08 07:58:09,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 417 states have (on average 1.7985611510791366) internal successors, (750), 663 states have internal predecessors, (750), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 766 transitions. [2025-02-08 07:58:09,919 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 766 transitions. Word has length 4 [2025-02-08 07:58:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:09,920 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 766 transitions. [2025-02-08 07:58:09,920 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:58:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 766 transitions. [2025-02-08 07:58:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 07:58:09,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:09,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 07:58:09,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 07:58:09,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:09,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:09,921 INFO L85 PathProgramCache]: Analyzing trace with hash 28713522, now seen corresponding path program 1 times [2025-02-08 07:58:09,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:09,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093165896] [2025-02-08 07:58:09,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:09,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 07:58:09,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 07:58:09,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:09,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:09,976 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:58:09,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:09,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093165896] [2025-02-08 07:58:09,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093165896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:09,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:09,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:58:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042908729] [2025-02-08 07:58:09,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:09,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:58:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:09,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:58:09,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:58:09,979 INFO L87 Difference]: Start difference. First operand 669 states and 766 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:58:10,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:10,085 INFO L93 Difference]: Finished difference Result 1295 states and 1479 transitions. [2025-02-08 07:58:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:58:10,086 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:58:10,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:10,092 INFO L225 Difference]: With dead ends: 1295 [2025-02-08 07:58:10,092 INFO L226 Difference]: Without dead ends: 1295 [2025-02-08 07:58:10,092 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:58:10,093 INFO L435 NwaCegarLoop]: 740 mSDtfsCounter, 706 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:10,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 1478 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:58:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2025-02-08 07:58:10,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 670. [2025-02-08 07:58:10,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 418 states have (on average 1.7966507177033493) internal successors, (751), 664 states have internal predecessors, (751), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:10,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 767 transitions. [2025-02-08 07:58:10,124 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 767 transitions. Word has length 4 [2025-02-08 07:58:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:10,125 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 767 transitions. [2025-02-08 07:58:10,125 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:58:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 767 transitions. [2025-02-08 07:58:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 07:58:10,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:10,126 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:58:10,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 07:58:10,126 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:10,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash -349345674, now seen corresponding path program 1 times [2025-02-08 07:58:10,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:10,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117676147] [2025-02-08 07:58:10,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:10,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:10,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 07:58:10,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 07:58:10,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:10,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:10,219 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:58:10,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:10,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117676147] [2025-02-08 07:58:10,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117676147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:10,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:10,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:58:10,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523069710] [2025-02-08 07:58:10,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:10,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:58:10,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:10,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:58:10,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:58:10,220 INFO L87 Difference]: Start difference. First operand 670 states and 767 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:58:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:10,798 INFO L93 Difference]: Finished difference Result 696 states and 820 transitions. [2025-02-08 07:58:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:58:10,799 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:58:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:10,802 INFO L225 Difference]: With dead ends: 696 [2025-02-08 07:58:10,802 INFO L226 Difference]: Without dead ends: 696 [2025-02-08 07:58:10,802 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:58:10,803 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 965 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:10,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 739 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:58:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-02-08 07:58:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 647. [2025-02-08 07:58:10,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 418 states have (on average 1.7416267942583732) internal successors, (728), 641 states have internal predecessors, (728), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:10,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 744 transitions. [2025-02-08 07:58:10,816 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 744 transitions. Word has length 10 [2025-02-08 07:58:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:10,816 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 744 transitions. [2025-02-08 07:58:10,816 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:58:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 744 transitions. [2025-02-08 07:58:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 07:58:10,817 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:10,817 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:58:10,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 07:58:10,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr314REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:10,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:10,818 INFO L85 PathProgramCache]: Analyzing trace with hash -349345673, now seen corresponding path program 1 times [2025-02-08 07:58:10,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:10,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359196775] [2025-02-08 07:58:10,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:10,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:10,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 07:58:10,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 07:58:10,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:10,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:10,895 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:58:10,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:10,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359196775] [2025-02-08 07:58:10,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359196775] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:10,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:10,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:58:10,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884699879] [2025-02-08 07:58:10,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:10,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:58:10,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:10,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:58:10,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:58:10,897 INFO L87 Difference]: Start difference. First operand 647 states and 744 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:58:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:10,942 INFO L93 Difference]: Finished difference Result 572 states and 641 transitions. [2025-02-08 07:58:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:58:10,943 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:58:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:10,945 INFO L225 Difference]: With dead ends: 572 [2025-02-08 07:58:10,945 INFO L226 Difference]: Without dead ends: 572 [2025-02-08 07:58:10,945 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:58:10,946 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 60 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:10,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1179 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 07:58:10,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-08 07:58:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-08 07:58:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 355 states have (on average 1.7605633802816902) internal successors, (625), 566 states have internal predecessors, (625), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 641 transitions. [2025-02-08 07:58:10,959 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 641 transitions. Word has length 10 [2025-02-08 07:58:10,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:10,960 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 641 transitions. [2025-02-08 07:58:10,960 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:58:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 641 transitions. [2025-02-08 07:58:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 07:58:10,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:10,960 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 07:58:10,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 07:58:10,960 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr290REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:10,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:10,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2055061787, now seen corresponding path program 1 times [2025-02-08 07:58:10,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:10,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037110704] [2025-02-08 07:58:10,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:10,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:10,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 07:58:10,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 07:58:10,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:10,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:11,031 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:58:11,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:11,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037110704] [2025-02-08 07:58:11,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037110704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:11,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:11,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:58:11,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788756671] [2025-02-08 07:58:11,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:11,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:58:11,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:11,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:58:11,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:58:11,033 INFO L87 Difference]: Start difference. First operand 572 states and 641 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:58:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:11,104 INFO L93 Difference]: Finished difference Result 554 states and 616 transitions. [2025-02-08 07:58:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:58:11,104 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:58:11,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:11,107 INFO L225 Difference]: With dead ends: 554 [2025-02-08 07:58:11,107 INFO L226 Difference]: Without dead ends: 554 [2025-02-08 07:58:11,107 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:58:11,108 INFO L435 NwaCegarLoop]: 581 mSDtfsCounter, 41 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1715 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:11,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1715 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:58:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-08 07:58:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2025-02-08 07:58:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 341 states have (on average 1.750733137829912) internal successors, (597), 545 states have internal predecessors, (597), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 613 transitions. [2025-02-08 07:58:11,123 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 613 transitions. Word has length 11 [2025-02-08 07:58:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:11,123 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 613 transitions. [2025-02-08 07:58:11,123 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:58:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 613 transitions. [2025-02-08 07:58:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 07:58:11,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:11,124 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:58:11,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 07:58:11,124 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr276REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1039576559, now seen corresponding path program 1 times [2025-02-08 07:58:11,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:11,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823928837] [2025-02-08 07:58:11,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:11,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 07:58:11,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 07:58:11,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:11,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:11,321 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:58:11,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:11,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823928837] [2025-02-08 07:58:11,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823928837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:11,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:11,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 07:58:11,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964011323] [2025-02-08 07:58:11,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:11,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:58:11,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:11,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:58:11,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:58:11,322 INFO L87 Difference]: Start difference. First operand 551 states and 613 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:58:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:11,828 INFO L93 Difference]: Finished difference Result 605 states and 695 transitions. [2025-02-08 07:58:11,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 07:58:11,828 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:58:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:11,831 INFO L225 Difference]: With dead ends: 605 [2025-02-08 07:58:11,831 INFO L226 Difference]: Without dead ends: 605 [2025-02-08 07:58:11,831 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:58:11,835 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 471 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:11,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 949 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:58:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-08 07:58:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 547. [2025-02-08 07:58:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 341 states have (on average 1.7390029325513197) internal successors, (593), 541 states have internal predecessors, (593), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 609 transitions. [2025-02-08 07:58:11,850 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 609 transitions. Word has length 25 [2025-02-08 07:58:11,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:11,850 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 609 transitions. [2025-02-08 07:58:11,850 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:58:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 609 transitions. [2025-02-08 07:58:11,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 07:58:11,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:11,852 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:58:11,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 07:58:11,852 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr261REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:11,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:11,852 INFO L85 PathProgramCache]: Analyzing trace with hash -592977163, now seen corresponding path program 1 times [2025-02-08 07:58:11,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:11,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560886504] [2025-02-08 07:58:11,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:11,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 07:58:11,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 07:58:11,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:11,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:11,979 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:58:11,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:11,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560886504] [2025-02-08 07:58:11,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560886504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:11,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:11,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:58:11,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651767882] [2025-02-08 07:58:11,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:11,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 07:58:11,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:11,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 07:58:11,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 07:58:11,981 INFO L87 Difference]: Start difference. First operand 547 states and 609 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:58:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:12,054 INFO L93 Difference]: Finished difference Result 547 states and 605 transitions. [2025-02-08 07:58:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 07:58:12,055 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:58:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:12,057 INFO L225 Difference]: With dead ends: 547 [2025-02-08 07:58:12,057 INFO L226 Difference]: Without dead ends: 547 [2025-02-08 07:58:12,057 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:58:12,058 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 21 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:12,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1697 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:58:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-08 07:58:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-02-08 07:58:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 341 states have (on average 1.7272727272727273) internal successors, (589), 541 states have internal predecessors, (589), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 605 transitions. [2025-02-08 07:58:12,069 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 605 transitions. Word has length 60 [2025-02-08 07:58:12,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:12,069 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 605 transitions. [2025-02-08 07:58:12,069 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:58:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 605 transitions. [2025-02-08 07:58:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 07:58:12,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:12,071 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:58:12,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 07:58:12,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr261REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:12,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash 386878253, now seen corresponding path program 1 times [2025-02-08 07:58:12,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:12,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458744707] [2025-02-08 07:58:12,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:12,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:12,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 07:58:12,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 07:58:12,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:12,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:12,206 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:58:12,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:12,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458744707] [2025-02-08 07:58:12,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458744707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:12,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:12,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 07:58:12,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743339767] [2025-02-08 07:58:12,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:12,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 07:58:12,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:12,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 07:58:12,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 07:58:12,209 INFO L87 Difference]: Start difference. First operand 547 states and 605 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:58:12,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:12,288 INFO L93 Difference]: Finished difference Result 639 states and 724 transitions. [2025-02-08 07:58:12,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 07:58:12,289 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:58:12,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:12,292 INFO L225 Difference]: With dead ends: 639 [2025-02-08 07:58:12,293 INFO L226 Difference]: Without dead ends: 639 [2025-02-08 07:58:12,293 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:58:12,294 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 54 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1152 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:12,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1152 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 07:58:12,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-08 07:58:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-02-08 07:58:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 433 states have (on average 1.6351039260969977) internal successors, (708), 633 states have internal predecessors, (708), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:12,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 724 transitions. [2025-02-08 07:58:12,305 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 724 transitions. Word has length 68 [2025-02-08 07:58:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:12,306 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 724 transitions. [2025-02-08 07:58:12,306 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:58:12,306 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 724 transitions. [2025-02-08 07:58:12,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:58:12,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:12,311 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:58:12,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 07:58:12,311 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr225REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:12,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:12,311 INFO L85 PathProgramCache]: Analyzing trace with hash 935466296, now seen corresponding path program 1 times [2025-02-08 07:58:12,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:12,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829000990] [2025-02-08 07:58:12,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:12,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:12,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 07:58:12,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:58:12,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:12,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:12,606 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:58:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829000990] [2025-02-08 07:58:12,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829000990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:12,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:12,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:58:12,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651088770] [2025-02-08 07:58:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:12,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:58:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:12,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:58:12,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:58:12,609 INFO L87 Difference]: Start difference. First operand 639 states and 724 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:58:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:13,148 INFO L93 Difference]: Finished difference Result 638 states and 723 transitions. [2025-02-08 07:58:13,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:58:13,148 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:58:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:13,150 INFO L225 Difference]: With dead ends: 638 [2025-02-08 07:58:13,150 INFO L226 Difference]: Without dead ends: 638 [2025-02-08 07:58:13,151 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:58:13,151 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 2 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:13,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1637 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 07:58:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-08 07:58:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2025-02-08 07:58:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 433 states have (on average 1.6327944572748267) internal successors, (707), 632 states have internal predecessors, (707), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 723 transitions. [2025-02-08 07:58:13,162 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 723 transitions. Word has length 76 [2025-02-08 07:58:13,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:13,163 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 723 transitions. [2025-02-08 07:58:13,163 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:58:13,163 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 723 transitions. [2025-02-08 07:58:13,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 07:58:13,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:13,164 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:58:13,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 07:58:13,164 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr226REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:13,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash 935466297, now seen corresponding path program 1 times [2025-02-08 07:58:13,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:13,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670485149] [2025-02-08 07:58:13,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:13,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:13,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 07:58:13,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 07:58:13,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:13,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:13,635 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:58:13,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:13,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670485149] [2025-02-08 07:58:13,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670485149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:13,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:13,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 07:58:13,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589847625] [2025-02-08 07:58:13,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:13,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 07:58:13,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:13,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 07:58:13,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 07:58:13,637 INFO L87 Difference]: Start difference. First operand 638 states and 723 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:58:14,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:14,256 INFO L93 Difference]: Finished difference Result 637 states and 722 transitions. [2025-02-08 07:58:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:58:14,257 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:58:14,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:14,260 INFO L225 Difference]: With dead ends: 637 [2025-02-08 07:58:14,260 INFO L226 Difference]: Without dead ends: 637 [2025-02-08 07:58:14,260 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:58:14,262 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 1 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:14,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1598 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:58:14,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-08 07:58:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2025-02-08 07:58:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 432 states have (on average 1.6342592592592593) internal successors, (706), 631 states have internal predecessors, (706), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 722 transitions. [2025-02-08 07:58:14,277 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 722 transitions. Word has length 76 [2025-02-08 07:58:14,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:14,278 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 722 transitions. [2025-02-08 07:58:14,278 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:58:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 722 transitions. [2025-02-08 07:58:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:58:14,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:14,280 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:58:14,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 07:58:14,281 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:14,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:14,281 INFO L85 PathProgramCache]: Analyzing trace with hash 747511445, now seen corresponding path program 1 times [2025-02-08 07:58:14,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:14,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198466112] [2025-02-08 07:58:14,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:14,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:14,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:58:14,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:58:14,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:14,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:14,539 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:58:14,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198466112] [2025-02-08 07:58:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198466112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:14,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:14,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 07:58:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012321782] [2025-02-08 07:58:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:14,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 07:58:14,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:14,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 07:58:14,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 07:58:14,541 INFO L87 Difference]: Start difference. First operand 637 states and 722 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:58:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:15,144 INFO L93 Difference]: Finished difference Result 649 states and 737 transitions. [2025-02-08 07:58:15,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 07:58:15,145 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:58:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:15,149 INFO L225 Difference]: With dead ends: 649 [2025-02-08 07:58:15,149 INFO L226 Difference]: Without dead ends: 649 [2025-02-08 07:58:15,149 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:58:15,150 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 10 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:15,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2155 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:58:15,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-08 07:58:15,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2025-02-08 07:58:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 437 states have (on average 1.631578947368421) internal successors, (713), 636 states have internal predecessors, (713), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 07:58:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 732 transitions. [2025-02-08 07:58:15,161 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 732 transitions. Word has length 84 [2025-02-08 07:58:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:15,162 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 732 transitions. [2025-02-08 07:58:15,162 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:58:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 732 transitions. [2025-02-08 07:58:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 07:58:15,163 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:15,163 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:58:15,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 07:58:15,163 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr222REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:15,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash 747511446, now seen corresponding path program 1 times [2025-02-08 07:58:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:15,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946259969] [2025-02-08 07:58:15,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:15,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 07:58:15,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 07:58:15,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:15,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:15,687 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:58:15,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:15,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946259969] [2025-02-08 07:58:15,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946259969] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:15,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:15,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 07:58:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543557298] [2025-02-08 07:58:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:15,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 07:58:15,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:15,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 07:58:15,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 07:58:15,688 INFO L87 Difference]: Start difference. First operand 643 states and 732 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:58:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:16,362 INFO L93 Difference]: Finished difference Result 643 states and 731 transitions. [2025-02-08 07:58:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 07:58:16,362 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:58:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:16,365 INFO L225 Difference]: With dead ends: 643 [2025-02-08 07:58:16,365 INFO L226 Difference]: Without dead ends: 643 [2025-02-08 07:58:16,365 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:58:16,365 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 5 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:16,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2041 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 07:58:16,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-02-08 07:58:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2025-02-08 07:58:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 437 states have (on average 1.6292906178489703) internal successors, (712), 636 states have internal predecessors, (712), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 07:58:16,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 731 transitions. [2025-02-08 07:58:16,377 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 731 transitions. Word has length 84 [2025-02-08 07:58:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:16,377 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 731 transitions. [2025-02-08 07:58:16,377 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:58:16,377 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 731 transitions. [2025-02-08 07:58:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 07:58:16,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:16,378 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:58:16,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 07:58:16,378 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr221REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:16,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash -151045995, now seen corresponding path program 1 times [2025-02-08 07:58:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:16,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257777272] [2025-02-08 07:58:16,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:16,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:16,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:58:16,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:58:16,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:16,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:16,916 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:58:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257777272] [2025-02-08 07:58:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257777272] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677988964] [2025-02-08 07:58:16,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:58:16,920 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:58:16,922 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:58:17,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:58:17,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:58:17,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:17,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:17,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 07:58:17,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:58:17,250 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:58:17,250 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:58:17,269 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:58:17,335 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:17,336 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:58:17,368 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:58:17,372 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:58:17,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:58:17,428 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-08 07:58:17,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-08 07:58:17,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677988964] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:17,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:58:17,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2025-02-08 07:58:17,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53226530] [2025-02-08 07:58:17,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:58:17,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:58:17,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:17,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:58:17,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=169, Unknown=6, NotChecked=0, Total=210 [2025-02-08 07:58:17,466 INFO L87 Difference]: Start difference. First operand 643 states and 731 transitions. Second operand has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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:58:19,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:19,062 INFO L93 Difference]: Finished difference Result 642 states and 730 transitions. [2025-02-08 07:58:19,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:58:19,062 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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:58:19,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:19,065 INFO L225 Difference]: With dead ends: 642 [2025-02-08 07:58:19,065 INFO L226 Difference]: Without dead ends: 642 [2025-02-08 07:58:19,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=372, Unknown=6, NotChecked=0, Total=462 [2025-02-08 07:58:19,066 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 519 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 3170 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:19,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 3170 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2836 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:58:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-02-08 07:58:19,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2025-02-08 07:58:19,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 437 states have (on average 1.6270022883295194) internal successors, (711), 635 states have internal predecessors, (711), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 07:58:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 730 transitions. [2025-02-08 07:58:19,077 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 730 transitions. Word has length 85 [2025-02-08 07:58:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:19,077 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 730 transitions. [2025-02-08 07:58:19,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.166666666666666) internal successors, (98), 13 states have internal predecessors, (98), 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:58:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 730 transitions. [2025-02-08 07:58:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 07:58:19,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:19,078 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:58:19,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 07:58:19,279 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,SelfDestructingSolverStorable13 [2025-02-08 07:58:19,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr222REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:19,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:19,280 INFO L85 PathProgramCache]: Analyzing trace with hash -151045994, now seen corresponding path program 1 times [2025-02-08 07:58:19,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:19,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537572121] [2025-02-08 07:58:19,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:19,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:19,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:58:19,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:58:19,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:19,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:20,000 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:58:20,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537572121] [2025-02-08 07:58:20,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537572121] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:20,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492398655] [2025-02-08 07:58:20,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:20,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:20,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:58:20,004 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:58:20,007 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:58:20,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 07:58:20,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 07:58:20,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:20,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:20,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 07:58:20,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:58:20,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:58:20,324 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:58:20,329 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:58:20,342 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:58:20,348 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:58:20,417 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:58:20,423 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:58:20,544 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:20,545 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:58:20,550 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:58:20,581 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:58:20,585 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:58:20,589 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:58:20,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:58:20,682 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_582 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))) (forall ((v_ArrVal_582 (Array Int Int)) (v_ArrVal_583 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_582) |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_583) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 07:58:20,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492398655] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:20,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:58:20,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-02-08 07:58:20,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625575651] [2025-02-08 07:58:20,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:58:20,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:58:20,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:20,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:58:20,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-08 07:58:20,687 INFO L87 Difference]: Start difference. First operand 642 states and 730 transitions. Second operand has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 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:58:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:22,454 INFO L93 Difference]: Finished difference Result 649 states and 737 transitions. [2025-02-08 07:58:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 07:58:22,454 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 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:58:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:22,457 INFO L225 Difference]: With dead ends: 649 [2025-02-08 07:58:22,457 INFO L226 Difference]: Without dead ends: 649 [2025-02-08 07:58:22,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-02-08 07:58:22,458 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 517 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 3218 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2697 SdHoareTripleChecker+Invalid, 3257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:22,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2697 Invalid, 3257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3218 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 07:58:22,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-08 07:58:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 640. [2025-02-08 07:58:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 436 states have (on average 1.6261467889908257) internal successors, (709), 633 states have internal predecessors, (709), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2025-02-08 07:58:22,471 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 725 transitions. Word has length 85 [2025-02-08 07:58:22,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:22,472 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 725 transitions. [2025-02-08 07:58:22,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 8.666666666666666) internal successors, (104), 15 states have internal predecessors, (104), 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:58:22,472 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 725 transitions. [2025-02-08 07:58:22,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 07:58:22,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:22,473 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:58:22,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 07:58:22,674 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,SelfDestructingSolverStorable14 [2025-02-08 07:58:22,674 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:22,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash -291474371, now seen corresponding path program 1 times [2025-02-08 07:58:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:22,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70277893] [2025-02-08 07:58:22,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:22,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 07:58:22,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 07:58:22,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:22,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:23,158 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:58:23,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:23,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70277893] [2025-02-08 07:58:23,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70277893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:23,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:23,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 07:58:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089945919] [2025-02-08 07:58:23,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:23,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 07:58:23,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:23,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 07:58:23,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 07:58:23,160 INFO L87 Difference]: Start difference. First operand 640 states and 725 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:58:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:24,302 INFO L93 Difference]: Finished difference Result 653 states and 741 transitions. [2025-02-08 07:58:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:58:24,302 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:58:24,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:24,305 INFO L225 Difference]: With dead ends: 653 [2025-02-08 07:58:24,305 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 07:58:24,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-08 07:58:24,305 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 521 mSDsluCounter, 2512 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:24,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2847 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:58:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 07:58:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2025-02-08 07:58:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 444 states have (on average 1.6193693693693694) internal successors, (719), 641 states have internal predecessors, (719), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:58:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 736 transitions. [2025-02-08 07:58:24,317 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 736 transitions. Word has length 87 [2025-02-08 07:58:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:24,317 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 736 transitions. [2025-02-08 07:58:24,317 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:58:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 736 transitions. [2025-02-08 07:58:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 07:58:24,318 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:24,318 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:58:24,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 07:58:24,318 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:24,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash -291474370, now seen corresponding path program 1 times [2025-02-08 07:58:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094042552] [2025-02-08 07:58:24,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:24,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 07:58:24,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 07:58:24,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:24,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:24,899 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:58:24,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:24,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094042552] [2025-02-08 07:58:24,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094042552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:24,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:24,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 07:58:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694511995] [2025-02-08 07:58:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:24,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 07:58:24,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:24,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 07:58:24,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 07:58:24,900 INFO L87 Difference]: Start difference. First operand 649 states and 736 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:58:25,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:25,981 INFO L93 Difference]: Finished difference Result 652 states and 740 transitions. [2025-02-08 07:58:25,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 07:58:25,982 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:58:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:25,984 INFO L225 Difference]: With dead ends: 652 [2025-02-08 07:58:25,984 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 07:58:25,984 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:58:25,984 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 518 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:25,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1982 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 07:58:25,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 07:58:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 649. [2025-02-08 07:58:25,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 444 states have (on average 1.617117117117117) internal successors, (718), 641 states have internal predecessors, (718), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:58:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 735 transitions. [2025-02-08 07:58:25,995 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 735 transitions. Word has length 87 [2025-02-08 07:58:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:25,995 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 735 transitions. [2025-02-08 07:58:25,995 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:58:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 735 transitions. [2025-02-08 07:58:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 07:58:25,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:25,996 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:58:25,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 07:58:25,996 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr217REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:25,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:25,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1314986557, now seen corresponding path program 1 times [2025-02-08 07:58:25,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:25,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061124764] [2025-02-08 07:58:25,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:25,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:26,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:58:26,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:58:26,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:26,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:26,449 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:58:26,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:26,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061124764] [2025-02-08 07:58:26,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061124764] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:26,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965457395] [2025-02-08 07:58:26,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:26,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:26,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:58:26,452 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:58:26,455 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:58:26,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:58:26,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:58:26,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:26,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:26,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 07:58:26,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:58:26,665 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:58:26,760 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:58:26,760 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:58:26,767 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:58:26,851 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:26,851 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:58:26,918 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:26,918 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:58:26,932 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:58:26,935 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:58:26,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:58:27,040 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-08 07:58:27,041 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:58:27,047 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_835 (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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_835))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_832)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-08 07:58:27,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965457395] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:27,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:58:27,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2025-02-08 07:58:27,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345619640] [2025-02-08 07:58:27,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:58:27,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 07:58:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:27,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 07:58:27,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=278, Unknown=13, NotChecked=34, Total=380 [2025-02-08 07:58:27,050 INFO L87 Difference]: Start difference. First operand 649 states and 735 transitions. Second operand has 17 states, 15 states have (on average 8.8) internal successors, (132), 17 states have internal predecessors, (132), 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:58:28,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:28,515 INFO L93 Difference]: Finished difference Result 651 states and 739 transitions. [2025-02-08 07:58:28,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:58:28,516 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.8) internal successors, (132), 17 states have internal predecessors, (132), 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 88 [2025-02-08 07:58:28,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:28,517 INFO L225 Difference]: With dead ends: 651 [2025-02-08 07:58:28,517 INFO L226 Difference]: Without dead ends: 651 [2025-02-08 07:58:28,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=526, Unknown=18, NotChecked=48, Total=702 [2025-02-08 07:58:28,518 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 489 mSDsluCounter, 3736 mSDsCounter, 0 mSdLazyCounter, 3614 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 4071 SdHoareTripleChecker+Invalid, 3638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:28,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 4071 Invalid, 3638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3614 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 07:58:28,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-08 07:58:28,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 648. [2025-02-08 07:58:28,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 444 states have (on average 1.614864864864865) internal successors, (717), 640 states have internal predecessors, (717), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:58:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 734 transitions. [2025-02-08 07:58:28,532 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 734 transitions. Word has length 88 [2025-02-08 07:58:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:28,532 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 734 transitions. [2025-02-08 07:58:28,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.8) internal successors, (132), 17 states have internal predecessors, (132), 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:58:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 734 transitions. [2025-02-08 07:58:28,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 07:58:28,533 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:28,533 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:58:28,542 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:58:28,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:28,734 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr218REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:28,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:28,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1314986558, now seen corresponding path program 1 times [2025-02-08 07:58:28,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:28,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964982867] [2025-02-08 07:58:28,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:28,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:28,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:58:28,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:58:28,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:28,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:29,462 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:58:29,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964982867] [2025-02-08 07:58:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964982867] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:29,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643302003] [2025-02-08 07:58:29,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:29,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:58:29,466 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:58:29,468 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:58:29,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 07:58:29,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 07:58:29,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:29,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:29,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 07:58:29,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:58:29,671 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:58:29,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:58:29,794 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:58:29,795 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:58:29,805 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:58:29,808 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:58:29,864 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:58:29,868 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:58:29,971 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:29,971 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:58:29,975 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:58:30,046 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:30,046 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:58:30,055 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:58:30,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 31 treesize of output 13 [2025-02-08 07:58:30,074 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:58:30,078 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:58:30,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:58:30,193 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_973 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_973 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:58:30,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_973 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_978) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_973 (Array Int Int)) (v_ArrVal_972 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_979))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_978) .cse1 v_ArrVal_973) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:58:30,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643302003] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:30,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:58:30,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2025-02-08 07:58:30,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652193279] [2025-02-08 07:58:30,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:58:30,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 07:58:30,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:30,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 07:58:30,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=275, Unknown=14, NotChecked=70, Total=420 [2025-02-08 07:58:30,252 INFO L87 Difference]: Start difference. First operand 648 states and 734 transitions. Second operand has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:58:32,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:32,192 INFO L93 Difference]: Finished difference Result 650 states and 738 transitions. [2025-02-08 07:58:32,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 07:58:32,192 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2025-02-08 07:58:32,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:32,194 INFO L225 Difference]: With dead ends: 650 [2025-02-08 07:58:32,195 INFO L226 Difference]: Without dead ends: 650 [2025-02-08 07:58:32,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=447, Unknown=15, NotChecked=90, Total=650 [2025-02-08 07:58:32,195 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 491 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 3517 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 3014 SdHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:32,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 3014 Invalid, 3541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3517 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 07:58:32,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-08 07:58:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 638. [2025-02-08 07:58:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 436 states have (on average 1.621559633027523) internal successors, (707), 631 states have internal predecessors, (707), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 723 transitions. [2025-02-08 07:58:32,205 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 723 transitions. Word has length 88 [2025-02-08 07:58:32,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:32,205 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 723 transitions. [2025-02-08 07:58:32,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.357142857142858) internal successors, (131), 16 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:58:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 723 transitions. [2025-02-08 07:58:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 07:58:32,206 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:32,206 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:58:32,215 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:58:32,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:32,407 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:32,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:32,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1111376494, now seen corresponding path program 1 times [2025-02-08 07:58:32,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:32,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979529032] [2025-02-08 07:58:32,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:32,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 07:58:32,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 07:58:32,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:32,863 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:58:32,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:32,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979529032] [2025-02-08 07:58:32,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979529032] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:32,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:32,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 07:58:32,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030017971] [2025-02-08 07:58:32,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:32,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 07:58:32,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:32,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 07:58:32,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-08 07:58:32,865 INFO L87 Difference]: Start difference. First operand 638 states and 723 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:58:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:34,180 INFO L93 Difference]: Finished difference Result 654 states and 742 transitions. [2025-02-08 07:58:34,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:58:34,181 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:58:34,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:34,183 INFO L225 Difference]: With dead ends: 654 [2025-02-08 07:58:34,183 INFO L226 Difference]: Without dead ends: 654 [2025-02-08 07:58:34,183 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:58:34,183 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 503 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3460 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:34,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3460 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3139 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-08 07:58:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-08 07:58:34,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 650. [2025-02-08 07:58:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 447 states have (on average 1.610738255033557) internal successors, (720), 642 states have internal predecessors, (720), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:58:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 737 transitions. [2025-02-08 07:58:34,193 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 737 transitions. Word has length 90 [2025-02-08 07:58:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:34,194 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 737 transitions. [2025-02-08 07:58:34,194 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:58:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 737 transitions. [2025-02-08 07:58:34,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 07:58:34,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:34,195 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:58:34,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 07:58:34,195 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:34,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:34,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1111376495, now seen corresponding path program 1 times [2025-02-08 07:58:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755847077] [2025-02-08 07:58:34,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:34,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 07:58:34,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 07:58:34,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:34,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:34,840 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:58:34,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:34,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755847077] [2025-02-08 07:58:34,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755847077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:34,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 07:58:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089013820] [2025-02-08 07:58:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:34,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 07:58:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:34,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 07:58:34,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 07:58:34,842 INFO L87 Difference]: Start difference. First operand 650 states and 737 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:58:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:36,243 INFO L93 Difference]: Finished difference Result 653 states and 741 transitions. [2025-02-08 07:58:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 07:58:36,243 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:58:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:36,245 INFO L225 Difference]: With dead ends: 653 [2025-02-08 07:58:36,245 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 07:58:36,246 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:58:36,246 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 502 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:36,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 2464 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2902 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-08 07:58:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 07:58:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2025-02-08 07:58:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 447 states have (on average 1.6085011185682327) internal successors, (719), 642 states have internal predecessors, (719), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:58:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 736 transitions. [2025-02-08 07:58:36,255 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 736 transitions. Word has length 90 [2025-02-08 07:58:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:36,256 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 736 transitions. [2025-02-08 07:58:36,256 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:58:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 736 transitions. [2025-02-08 07:58:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 07:58:36,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:36,257 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:58:36,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 07:58:36,257 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:36,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:36,257 INFO L85 PathProgramCache]: Analyzing trace with hash 368303214, now seen corresponding path program 1 times [2025-02-08 07:58:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:36,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008295914] [2025-02-08 07:58:36,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:36,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:58:36,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:58:36,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:36,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:36,731 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:58:36,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:36,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008295914] [2025-02-08 07:58:36,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008295914] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:36,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103095848] [2025-02-08 07:58:36,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:36,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:36,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:58:36,734 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:58:36,736 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:58:36,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:58:36,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:58:36,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:36,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:36,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 07:58:36,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:58:36,937 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:58:37,036 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:58:37,037 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:58:37,045 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:58:37,125 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:37,126 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:58:37,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:37,174 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:58:37,223 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:37,223 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:58:37,236 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:58:37,240 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:58:37,240 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:58:37,324 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (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_1252))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1253)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:58:41,482 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-02-08 07:58:41,482 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:58:41,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103095848] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:41,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:58:41,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-02-08 07:58:41,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264971242] [2025-02-08 07:58:41,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:58:41,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 07:58:41,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:41,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 07:58:41,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=406, Unknown=30, NotChecked=42, Total=552 [2025-02-08 07:58:41,532 INFO L87 Difference]: Start difference. First operand 650 states and 736 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:58:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:43,106 INFO L93 Difference]: Finished difference Result 652 states and 740 transitions. [2025-02-08 07:58:43,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:58:43,108 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:58:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:43,110 INFO L225 Difference]: With dead ends: 652 [2025-02-08 07:58:43,110 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 07:58:43,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=147, Invalid=756, Unknown=31, NotChecked=58, Total=992 [2025-02-08 07:58:43,112 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 491 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 3082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:43,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 3443 Invalid, 3082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 07:58:43,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 07:58:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 649. [2025-02-08 07:58:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 447 states have (on average 1.6062639821029083) internal successors, (718), 641 states have internal predecessors, (718), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:58:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 735 transitions. [2025-02-08 07:58:43,121 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 735 transitions. Word has length 91 [2025-02-08 07:58:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:43,121 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 735 transitions. [2025-02-08 07:58:43,121 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:58:43,121 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 735 transitions. [2025-02-08 07:58:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 07:58:43,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:43,122 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:58:43,131 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:58:43,326 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,SelfDestructingSolverStorable21 [2025-02-08 07:58:43,326 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr214REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:43,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:43,326 INFO L85 PathProgramCache]: Analyzing trace with hash 368303215, now seen corresponding path program 1 times [2025-02-08 07:58:43,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:43,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775556648] [2025-02-08 07:58:43,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:43,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:43,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:58:43,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:58:43,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:43,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:44,053 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:58:44,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:44,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775556648] [2025-02-08 07:58:44,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775556648] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:44,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669131963] [2025-02-08 07:58:44,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:44,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:44,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:58:44,056 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:58:44,058 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:58:44,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 07:58:44,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 07:58:44,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:44,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:44,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 07:58:44,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:58:44,247 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:58:44,367 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:58:44,368 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:58:44,374 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:58:44,399 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:58:44,407 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:58:44,463 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:58:44,469 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:58:44,554 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:44,555 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:58:44,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:58:44,631 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:44,631 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:58:44,637 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:58:44,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:44,687 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:58:44,693 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:58:44,709 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:58:44,715 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:58:44,716 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:58:44,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:58:44,771 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1407 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2025-02-08 07:58:44,781 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_1407 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:58:44,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1406))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1405) .cse0 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1405) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2025-02-08 07:58:44,827 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_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1405) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1406))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1405) .cse2 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2025-02-08 07:58:44,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1414))) (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~mem50#1.base| v_ArrVal_1413) .cse0 v_ArrVal_1405) (select (select (store .cse1 .cse0 v_ArrVal_1406) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1407))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1406 (Array Int Int)) (v_ArrVal_1405 (Array Int Int)) (v_ArrVal_1414 (Array Int Int)) (v_ArrVal_1413 (Array Int Int)) (v_ArrVal_1408 (Array Int Int)) (v_ArrVal_1407 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1414))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1406))) (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~mem50#1.base| v_ArrVal_1413) .cse3 v_ArrVal_1405) .cse4 v_ArrVal_1407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 07:58:44,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669131963] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:44,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:58:44,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2025-02-08 07:58:44,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485285691] [2025-02-08 07:58:44,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:58:44,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 07:58:44,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:44,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 07:58:44,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2025-02-08 07:58:44,896 INFO L87 Difference]: Start difference. First operand 649 states and 735 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, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:58:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:46,584 INFO L93 Difference]: Finished difference Result 651 states and 739 transitions. [2025-02-08 07:58:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 07:58:46,585 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, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2025-02-08 07:58:46,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:46,586 INFO L225 Difference]: With dead ends: 651 [2025-02-08 07:58:46,586 INFO L226 Difference]: Without dead ends: 651 [2025-02-08 07:58:46,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2025-02-08 07:58:46,587 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 492 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1943 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:46,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1943 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:58:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-08 07:58:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 636. [2025-02-08 07:58:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 436 states have (on average 1.6169724770642202) internal successors, (705), 629 states have internal predecessors, (705), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 721 transitions. [2025-02-08 07:58:46,595 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 721 transitions. Word has length 91 [2025-02-08 07:58:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:46,595 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 721 transitions. [2025-02-08 07:58:46,596 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, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:58:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 721 transitions. [2025-02-08 07:58:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:58:46,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:46,597 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:58:46,607 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:58:46,797 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,SelfDestructingSolverStorable22 [2025-02-08 07:58:46,797 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:46,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:46,798 INFO L85 PathProgramCache]: Analyzing trace with hash -885268618, now seen corresponding path program 1 times [2025-02-08 07:58:46,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:46,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073249253] [2025-02-08 07:58:46,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:46,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:58:46,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:58:46,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:46,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:47,331 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:58:47,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:47,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073249253] [2025-02-08 07:58:47,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073249253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:47,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:47,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 07:58:47,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703762802] [2025-02-08 07:58:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:47,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 07:58:47,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:47,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 07:58:47,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-08 07:58:47,332 INFO L87 Difference]: Start difference. First operand 636 states and 721 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:58:48,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:48,606 INFO L93 Difference]: Finished difference Result 655 states and 743 transitions. [2025-02-08 07:58:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:58:48,606 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:58:48,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:48,608 INFO L225 Difference]: With dead ends: 655 [2025-02-08 07:58:48,608 INFO L226 Difference]: Without dead ends: 655 [2025-02-08 07:58:48,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-08 07:58:48,609 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 510 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:48,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 2503 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2327 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:58:48,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-08 07:58:48,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 651. [2025-02-08 07:58:48,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 450 states have (on average 1.6022222222222222) internal successors, (721), 643 states have internal predecessors, (721), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:58:48,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 738 transitions. [2025-02-08 07:58:48,621 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 738 transitions. Word has length 93 [2025-02-08 07:58:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:48,621 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 738 transitions. [2025-02-08 07:58:48,621 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:58:48,623 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 738 transitions. [2025-02-08 07:58:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 07:58:48,624 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:48,624 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:58:48,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 07:58:48,624 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:48,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:48,625 INFO L85 PathProgramCache]: Analyzing trace with hash -885268617, now seen corresponding path program 1 times [2025-02-08 07:58:48,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:48,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344024758] [2025-02-08 07:58:48,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:48,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:48,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 07:58:48,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 07:58:48,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:48,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:49,310 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:58:49,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:49,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344024758] [2025-02-08 07:58:49,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344024758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:49,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:49,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 07:58:49,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950404211] [2025-02-08 07:58:49,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:49,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 07:58:49,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:49,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 07:58:49,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 07:58:49,314 INFO L87 Difference]: Start difference. First operand 651 states and 738 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:58:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:50,529 INFO L93 Difference]: Finished difference Result 654 states and 742 transitions. [2025-02-08 07:58:50,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 07:58:50,530 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:58:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:50,531 INFO L225 Difference]: With dead ends: 654 [2025-02-08 07:58:50,531 INFO L226 Difference]: Without dead ends: 654 [2025-02-08 07:58:50,532 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:58:50,532 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 503 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 2213 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 2235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:50,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1989 Invalid, 2235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2213 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:58:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-08 07:58:50,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2025-02-08 07:58:50,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 450 states have (on average 1.6) internal successors, (720), 643 states have internal predecessors, (720), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:58:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 737 transitions. [2025-02-08 07:58:50,540 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 737 transitions. Word has length 93 [2025-02-08 07:58:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:50,540 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 737 transitions. [2025-02-08 07:58:50,540 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:58:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 737 transitions. [2025-02-08 07:58:50,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:58:50,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:50,541 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:58:50,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 07:58:50,541 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr209REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:50,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1519909514, now seen corresponding path program 1 times [2025-02-08 07:58:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910821390] [2025-02-08 07:58:50,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:50,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:58:50,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:58:50,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:50,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:51,113 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:58:51,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910821390] [2025-02-08 07:58:51,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910821390] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:51,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129496262] [2025-02-08 07:58:51,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:51,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:51,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:58:51,116 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:58:51,118 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:58:51,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:58:51,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:58:51,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:51,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:51,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 07:58:51,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:58:51,324 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:58:51,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:58:51,451 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:58:51,457 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:58:51,541 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:51,541 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:58:51,590 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:51,590 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:58:51,630 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:51,630 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:58:51,678 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:51,678 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:58:51,692 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:58:51,695 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:58:51,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:58:51,794 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 (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~mem53#1.base| v_ArrVal_1712))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:58:51,805 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1712))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:58:51,819 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int))) (= (select |c_#valid| (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~mem52#1.base| v_ArrVal_1711))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1712)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2025-02-08 07:58:51,918 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-02-08 07:58:51,919 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 105 treesize of output 104 [2025-02-08 07:58:51,924 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int)) (v_ArrVal_1716 (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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1716))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1711)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1712)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2025-02-08 07:58:51,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129496262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:51,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:58:51,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-02-08 07:58:51,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959572641] [2025-02-08 07:58:51,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:58:51,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 07:58:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:51,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 07:58:51,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=454, Unknown=22, NotChecked=188, Total=756 [2025-02-08 07:58:51,928 INFO L87 Difference]: Start difference. First operand 651 states and 737 transitions. Second operand has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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:58:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:53,193 INFO L93 Difference]: Finished difference Result 653 states and 741 transitions. [2025-02-08 07:58:53,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:58:53,193 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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 94 [2025-02-08 07:58:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:53,196 INFO L225 Difference]: With dead ends: 653 [2025-02-08 07:58:53,196 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 07:58:53,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=175, Invalid=875, Unknown=22, NotChecked=260, Total=1332 [2025-02-08 07:58:53,199 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 493 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:53,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 2519 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-08 07:58:53,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 07:58:53,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2025-02-08 07:58:53,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 450 states have (on average 1.5977777777777777) internal successors, (719), 642 states have internal predecessors, (719), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:58:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 736 transitions. [2025-02-08 07:58:53,207 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 736 transitions. Word has length 94 [2025-02-08 07:58:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:53,208 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 736 transitions. [2025-02-08 07:58:53,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.473684210526316) internal successors, (142), 21 states have internal predecessors, (142), 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:58:53,208 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 736 transitions. [2025-02-08 07:58:53,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 07:58:53,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:53,208 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:58:53,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-08 07:58:53,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:53,409 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr210REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:53,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:53,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1519909513, now seen corresponding path program 1 times [2025-02-08 07:58:53,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:53,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950597878] [2025-02-08 07:58:53,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:53,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:53,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:58:53,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:58:53,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:53,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:54,108 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:58:54,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:54,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950597878] [2025-02-08 07:58:54,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950597878] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:54,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886274850] [2025-02-08 07:58:54,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:54,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:58:54,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:58:54,111 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:58:54,113 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:58:54,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 07:58:54,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 07:58:54,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:54,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:54,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 07:58:54,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:58:54,353 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:58:54,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:58:54,450 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:58:54,454 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:58:54,458 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:58:54,463 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:58:54,504 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:58:54,507 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:58:54,590 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:54,590 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:58:54,595 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:58:54,656 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:54,656 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:58:54,662 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:58:54,709 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:54,709 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:58:54,714 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:58:54,760 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:58:54,761 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:58:54,771 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:58:54,784 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:58:54,788 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:58:54,790 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:58:54,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:58:54,894 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_1881 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2025-02-08 07:58:54,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1879) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1880))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1879) .cse1 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2025-02-08 07:58:55,064 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (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_1878))) (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_1877) .cse0 v_ArrVal_1879) (select (select (store .cse1 .cse0 v_ArrVal_1880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1881))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1878))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1880))) (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_1877) .cse3 v_ArrVal_1879) .cse4 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2025-02-08 07:58:57,051 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1888))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_1878))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1880))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1887) .cse0 v_ArrVal_1877) .cse1 v_ArrVal_1879) .cse2 v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1879 (Array Int Int)) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1887 (Array Int Int)) (v_ArrVal_1881 (Array Int Int)) (v_ArrVal_1880 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1888))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_1878))) (let ((.cse8 (select (select .cse9 |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_1887) .cse7 v_ArrVal_1877) .cse8 v_ArrVal_1879) (select (select (store .cse9 .cse8 v_ArrVal_1880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1881))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2025-02-08 07:58:57,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886274850] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:58:57,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:58:57,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2025-02-08 07:58:57,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488990269] [2025-02-08 07:58:57,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:58:57,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 07:58:57,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:57,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 07:58:57,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=480, Unknown=31, NotChecked=196, Total=812 [2025-02-08 07:58:57,056 INFO L87 Difference]: Start difference. First operand 650 states and 736 transitions. Second operand has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:58:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:58:58,891 INFO L93 Difference]: Finished difference Result 652 states and 740 transitions. [2025-02-08 07:58:58,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 07:58:58,891 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2025-02-08 07:58:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:58:58,893 INFO L225 Difference]: With dead ends: 652 [2025-02-08 07:58:58,893 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 07:58:58,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=172, Invalid=800, Unknown=36, NotChecked=252, Total=1260 [2025-02-08 07:58:58,894 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 491 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 3257 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 07:58:58,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 2704 Invalid, 3294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3257 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 07:58:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 07:58:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 634. [2025-02-08 07:58:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 436 states have (on average 1.6123853211009174) internal successors, (703), 627 states have internal predecessors, (703), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 07:58:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 719 transitions. [2025-02-08 07:58:58,900 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 719 transitions. Word has length 94 [2025-02-08 07:58:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:58:58,900 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 719 transitions. [2025-02-08 07:58:58,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 07:58:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 719 transitions. [2025-02-08 07:58:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:58:58,901 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:58:58,901 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:58:58,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 07:58:59,102 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,SelfDestructingSolverStorable26 [2025-02-08 07:58:59,102 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:58:59,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:58:59,103 INFO L85 PathProgramCache]: Analyzing trace with hash 60072112, now seen corresponding path program 1 times [2025-02-08 07:58:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:58:59,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895174981] [2025-02-08 07:58:59,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:58:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:58:59,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:58:59,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:58:59,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:58:59,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:58:59,795 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:58:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:58:59,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895174981] [2025-02-08 07:58:59,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895174981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:58:59,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:58:59,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 07:58:59,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328196022] [2025-02-08 07:58:59,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:58:59,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 07:58:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:58:59,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 07:58:59,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-08 07:58:59,797 INFO L87 Difference]: Start difference. First operand 634 states and 719 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:59:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:59:01,431 INFO L93 Difference]: Finished difference Result 657 states and 745 transitions. [2025-02-08 07:59:01,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:59:01,432 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:59:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:59:01,434 INFO L225 Difference]: With dead ends: 657 [2025-02-08 07:59:01,434 INFO L226 Difference]: Without dead ends: 657 [2025-02-08 07:59:01,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-02-08 07:59:01,434 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 512 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 3161 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 3409 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 07:59:01,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 3409 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3161 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 07:59:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-02-08 07:59:01,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2025-02-08 07:59:01,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 454 states have (on average 1.592511013215859) internal successors, (723), 645 states have internal predecessors, (723), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:59:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 740 transitions. [2025-02-08 07:59:01,442 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 740 transitions. Word has length 97 [2025-02-08 07:59:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:59:01,443 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 740 transitions. [2025-02-08 07:59:01,443 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:59:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 740 transitions. [2025-02-08 07:59:01,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 07:59:01,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:59:01,444 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:59:01,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 07:59:01,444 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:59:01,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:59:01,445 INFO L85 PathProgramCache]: Analyzing trace with hash 60072113, now seen corresponding path program 1 times [2025-02-08 07:59:01,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:59:01,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827730358] [2025-02-08 07:59:01,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:59:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:59:01,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 07:59:01,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 07:59:01,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:59:01,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:59:02,362 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:59:02,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:59:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827730358] [2025-02-08 07:59:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827730358] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 07:59:02,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 07:59:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 07:59:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414037132] [2025-02-08 07:59:02,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 07:59:02,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 07:59:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:59:02,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 07:59:02,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-08 07:59:02,364 INFO L87 Difference]: Start difference. First operand 653 states and 740 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:59:04,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:59:04,707 INFO L93 Difference]: Finished difference Result 656 states and 744 transitions. [2025-02-08 07:59:04,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 07:59:04,707 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:59:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:59:04,709 INFO L225 Difference]: With dead ends: 656 [2025-02-08 07:59:04,709 INFO L226 Difference]: Without dead ends: 656 [2025-02-08 07:59:04,709 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:59:04,710 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 503 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 3944 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 3970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-08 07:59:04,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3213 Invalid, 3970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3944 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-08 07:59:04,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-02-08 07:59:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 653. [2025-02-08 07:59:04,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 454 states have (on average 1.5903083700440528) internal successors, (722), 645 states have internal predecessors, (722), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:59:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 739 transitions. [2025-02-08 07:59:04,717 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 739 transitions. Word has length 97 [2025-02-08 07:59:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:59:04,717 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 739 transitions. [2025-02-08 07:59:04,717 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:59:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 739 transitions. [2025-02-08 07:59:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:59:04,718 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:59:04,718 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:59:04,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 07:59:04,720 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr205REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:59:04,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:59:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -12728656, now seen corresponding path program 1 times [2025-02-08 07:59:04,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:59:04,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294586465] [2025-02-08 07:59:04,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:59:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:59:04,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:59:04,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:59:04,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:59:04,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:59:05,424 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:59:05,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:59:05,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294586465] [2025-02-08 07:59:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294586465] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:59:05,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055076151] [2025-02-08 07:59:05,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:59:05,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:59:05,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:59:05,426 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:59:05,427 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:59:05,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:59:05,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:59:05,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:59:05,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:59:05,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 07:59:05,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:59:05,651 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:59:05,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:59:05,762 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:59:05,771 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:59:05,823 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:05,823 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:59:05,850 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:05,851 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:59:05,906 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:05,906 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:59:05,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:05,945 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:59:05,984 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:05,984 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:59:05,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 07:59:06,009 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 07:59:06,009 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:59:06,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:59:06,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:59:06,573 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-02-08 07:59:06,573 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:59:06,595 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2218 (Array Int Int)) (v_ArrVal_2217 (Array Int Int)) (v_ArrVal_2224 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (= (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_2224))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2217)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2218)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2219)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2220)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2025-02-08 07:59:06,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055076151] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:59:06,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 07:59:06,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 20 [2025-02-08 07:59:06,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338887034] [2025-02-08 07:59:06,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 07:59:06,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 07:59:06,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 07:59:06,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 07:59:06,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=752, Unknown=46, NotChecked=58, Total=992 [2025-02-08 07:59:06,600 INFO L87 Difference]: Start difference. First operand 653 states and 739 transitions. Second operand has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 1 states have call successors, (1), 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:59:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 07:59:08,420 INFO L93 Difference]: Finished difference Result 655 states and 743 transitions. [2025-02-08 07:59:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 07:59:08,420 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 1 states have call successors, (1), 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 98 [2025-02-08 07:59:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 07:59:08,422 INFO L225 Difference]: With dead ends: 655 [2025-02-08 07:59:08,422 INFO L226 Difference]: Without dead ends: 655 [2025-02-08 07:59:08,422 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=1343, Unknown=46, NotChecked=78, Total=1722 [2025-02-08 07:59:08,423 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 490 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 3728 SdHoareTripleChecker+Invalid, 3399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 07:59:08,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 3728 Invalid, 3399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 07:59:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-08 07:59:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 652. [2025-02-08 07:59:08,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 454 states have (on average 1.5881057268722467) internal successors, (721), 644 states have internal predecessors, (721), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 07:59:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 738 transitions. [2025-02-08 07:59:08,428 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 738 transitions. Word has length 98 [2025-02-08 07:59:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 07:59:08,429 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 738 transitions. [2025-02-08 07:59:08,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 1 states have call successors, (1), 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:59:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 738 transitions. [2025-02-08 07:59:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 07:59:08,429 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 07:59:08,429 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:59:08,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 07:59:08,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:59:08,630 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr206REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 07:59:08,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 07:59:08,630 INFO L85 PathProgramCache]: Analyzing trace with hash -12728655, now seen corresponding path program 1 times [2025-02-08 07:59:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 07:59:08,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244897620] [2025-02-08 07:59:08,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:59:08,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 07:59:08,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:59:08,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:59:08,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:59:08,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:59:09,453 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:59:09,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 07:59:09,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244897620] [2025-02-08 07:59:09,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244897620] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 07:59:09,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106123044] [2025-02-08 07:59:09,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 07:59:09,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 07:59:09,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 07:59:09,456 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 07:59:09,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 07:59:09,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 07:59:09,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 07:59:09,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 07:59:09,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 07:59:09,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 07:59:09,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 07:59:09,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 07:59:09,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 07:59:09,804 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:59:09,805 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:59:09,828 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:59:09,832 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:59:09,904 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:59:09,906 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:59:10,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:10,042 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 73 treesize of output 66 [2025-02-08 07:59:10,052 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:59:10,164 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:10,165 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 73 treesize of output 66 [2025-02-08 07:59:10,174 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:59:10,264 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:10,264 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 73 treesize of output 66 [2025-02-08 07:59:10,269 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:59:10,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:10,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 73 treesize of output 66 [2025-02-08 07:59:10,397 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:59:10,519 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 07:59:10,519 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 73 treesize of output 66 [2025-02-08 07:59:10,525 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:59:10,561 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 42 treesize of output 18 [2025-02-08 07:59:10,570 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:59:10,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 07:59:10,648 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-02-08 07:59:10,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2025-02-08 07:59:10,659 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 07:59:10,659 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:59:10,696 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:59:10,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 07:59:12,080 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0))) (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (< 0 (+ (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2401))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2404))) (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~mem52#1.base| v_ArrVal_2402) .cse0 v_ArrVal_2403) .cse1 v_ArrVal_2406) (select (select (store .cse2 .cse1 v_ArrVal_2405) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2408))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 1)))) (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2408 (Array Int Int))) (or (forall ((v_ArrVal_2409 Int)) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2401))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2404))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2405))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2402) .cse5 v_ArrVal_2403) .cse6 v_ArrVal_2406) .cse7 v_ArrVal_2408) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_7| v_ArrVal_2409) (select (select (store .cse8 .cse7 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_7|) 0)))))) is different from false