./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_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_SAX_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 a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 08:01:51,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 08:01:51,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 08:01:51,564 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 08:01:51,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 08:01:51,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 08:01:51,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 08:01:51,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 08:01:51,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 08:01:51,592 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 08:01:51,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 08:01:51,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 08:01:51,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 08:01:51,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 08:01:51,593 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 08:01:51,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 08:01:51,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 08:01:51,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 08:01:51,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 08:01:51,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 08:01:51,594 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 08:01:51,594 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 08:01:51,594 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 08:01:51,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 08:01:51,594 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 08:01:51,594 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 08:01:51,594 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 08:01:51,594 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 08:01:51,594 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 08:01:51,595 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 08:01:51,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 08:01:51,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 08:01:51,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 08:01:51,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:01:51,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 08:01:51,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 08:01:51,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 08:01:51,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 08:01:51,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 08:01:51,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 08:01:51,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 08:01:51,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 08:01:51,596 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 -> a74358cfc3b57ddf641c2843362a5594690e287c76148ee1838c9104dbe09de1 [2025-02-08 08:01:51,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 08:01:51,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 08:01:51,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 08:01:51,826 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 08:01:51,826 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 08:01:51,827 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_SAX_test1-1.i [2025-02-08 08:01:53,167 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0845aaab/a4601d89859348dd872ea4d377585605/FLAG4a8e1c299 [2025-02-08 08:01:53,539 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 08:01:53,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test1-1.i [2025-02-08 08:01:53,549 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0845aaab/a4601d89859348dd872ea4d377585605/FLAG4a8e1c299 [2025-02-08 08:01:53,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f0845aaab/a4601d89859348dd872ea4d377585605 [2025-02-08 08:01:53,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 08:01:53,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 08:01:53,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 08:01:53,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 08:01:53,567 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 08:01:53,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:53,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19cd0970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53, skipping insertion in model container [2025-02-08 08:01:53,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:53,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 08:01:53,768 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 08:01:53,792 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 08:01:53,794 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 08:01:53,796 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 08:01:53,800 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 08:01:53,808 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 08:01:53,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:01:53,820 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 08:01:53,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 08:01:53,906 INFO L204 MainTranslator]: Completed translation [2025-02-08 08:01:53,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53 WrapperNode [2025-02-08 08:01:53,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 08:01:53,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 08:01:53,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 08:01:53,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 08:01:53,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:53,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:53,949 INFO L138 Inliner]: procedures = 176, calls = 180, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 823 [2025-02-08 08:01:53,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 08:01:53,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 08:01:53,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 08:01:53,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 08:01:53,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:53,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:53,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:54,006 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 08:01:54,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:54,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:54,021 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:54,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:54,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:54,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:54,030 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 08:01:54,030 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 08:01:54,030 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 08:01:54,031 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 08:01:54,031 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (1/1) ... [2025-02-08 08:01:54,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 08:01:54,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:01:54,063 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 08:01:54,072 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 08:01:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 08:01:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 08:01:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 08:01:54,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 08:01:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 08:01:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 08:01:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-02-08 08:01:54,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-02-08 08:01:54,087 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-02-08 08:01:54,087 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-02-08 08:01:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 08:01:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 08:01:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 08:01:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 08:01:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 08:01:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 08:01:54,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 08:01:54,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 08:01:54,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 08:01:54,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 08:01:54,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 08:01:54,244 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 08:01:54,245 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 08:01:55,492 INFO L? ?]: Removed 774 outVars from TransFormulas that were not future-live. [2025-02-08 08:01:55,492 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 08:01:55,547 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 08:01:55,548 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-08 08:01:55,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:01:55 BoogieIcfgContainer [2025-02-08 08:01:55,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 08:01:55,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 08:01:55,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 08:01:55,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 08:01:55,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 08:01:53" (1/3) ... [2025-02-08 08:01:55,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50050667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:01:55, skipping insertion in model container [2025-02-08 08:01:55,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 08:01:53" (2/3) ... [2025-02-08 08:01:55,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50050667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 08:01:55, skipping insertion in model container [2025-02-08 08:01:55,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 08:01:55" (3/3) ... [2025-02-08 08:01:55,557 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test1-1.i [2025-02-08 08:01:55,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 08:01:55,569 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_test1-1.i that has 4 procedures, 763 locations, 1 initial locations, 20 loop locations, and 320 error locations. [2025-02-08 08:01:55,612 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 08:01:55,621 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;@60d9ea0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 08:01:55,622 INFO L334 AbstractCegarLoop]: Starting to check reachability of 320 error locations. [2025-02-08 08:01:55,627 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 08:01:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:01:55,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:55,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:01:55,632 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 08:01:55,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 29551613, now seen corresponding path program 1 times [2025-02-08 08:01:55,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:55,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014852412] [2025-02-08 08:01:55,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:55,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:55,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:01:55,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:01:55,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:55,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:55,761 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 08:01:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:55,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014852412] [2025-02-08 08:01:55,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014852412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:55,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:55,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:01:55,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274352792] [2025-02-08 08:01:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:55,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:55,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:55,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:55,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:55,786 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 08:01:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:56,575 INFO L93 Difference]: Finished difference Result 700 states and 807 transitions. [2025-02-08 08:01:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:56,576 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 08:01:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:56,589 INFO L225 Difference]: With dead ends: 700 [2025-02-08 08:01:56,589 INFO L226 Difference]: Without dead ends: 695 [2025-02-08 08:01:56,591 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 08:01:56,593 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.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:56,595 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.7s Time] [2025-02-08 08:01:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-02-08 08:01:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 694. [2025-02-08 08:01:56,650 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 08:01:56,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 791 transitions. [2025-02-08 08:01:56,661 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 791 transitions. Word has length 4 [2025-02-08 08:01:56,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:56,661 INFO L471 AbstractCegarLoop]: Abstraction has 694 states and 791 transitions. [2025-02-08 08:01:56,661 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 08:01:56,661 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 791 transitions. [2025-02-08 08:01:56,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:01:56,662 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:56,662 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:01:56,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 08:01:56,662 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 08:01:56,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 29551614, now seen corresponding path program 1 times [2025-02-08 08:01:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:56,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014465229] [2025-02-08 08:01:56,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:56,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:56,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:01:56,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:01:56,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:56,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:56,753 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 08:01:56,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:56,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014465229] [2025-02-08 08:01:56,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014465229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:56,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:56,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:01:56,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014242488] [2025-02-08 08:01:56,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:56,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:56,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:56,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:56,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:56,756 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 08:01:57,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:57,096 INFO L93 Difference]: Finished difference Result 678 states and 776 transitions. [2025-02-08 08:01:57,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:57,097 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 08:01:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:57,099 INFO L225 Difference]: With dead ends: 678 [2025-02-08 08:01:57,099 INFO L226 Difference]: Without dead ends: 678 [2025-02-08 08:01:57,099 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 08:01:57,100 INFO L435 NwaCegarLoop]: 594 mSDtfsCounter, 466 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:57,100 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.3s Time] [2025-02-08 08:01:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-02-08 08:01:57,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 669. [2025-02-08 08:01:57,115 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 08:01:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 766 transitions. [2025-02-08 08:01:57,117 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 766 transitions. Word has length 4 [2025-02-08 08:01:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:57,117 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 766 transitions. [2025-02-08 08:01:57,117 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 08:01:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 766 transitions. [2025-02-08 08:01:57,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 08:01:57,122 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:57,122 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 08:01:57,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 08:01:57,122 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 08:01:57,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:57,122 INFO L85 PathProgramCache]: Analyzing trace with hash 28713522, now seen corresponding path program 1 times [2025-02-08 08:01:57,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:57,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626592071] [2025-02-08 08:01:57,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:57,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:57,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 08:01:57,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 08:01:57,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:57,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:57,149 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 08:01:57,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:57,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626592071] [2025-02-08 08:01:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626592071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:57,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:01:57,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735003274] [2025-02-08 08:01:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:57,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:57,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:57,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:57,155 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 08:01:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:57,268 INFO L93 Difference]: Finished difference Result 1295 states and 1479 transitions. [2025-02-08 08:01:57,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:57,268 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 08:01:57,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:57,272 INFO L225 Difference]: With dead ends: 1295 [2025-02-08 08:01:57,272 INFO L226 Difference]: Without dead ends: 1295 [2025-02-08 08:01:57,272 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 08:01:57,273 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 08:01:57,273 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 08:01:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2025-02-08 08:01:57,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 670. [2025-02-08 08:01:57,293 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 08:01:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 767 transitions. [2025-02-08 08:01:57,297 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 767 transitions. Word has length 4 [2025-02-08 08:01:57,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:57,297 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 767 transitions. [2025-02-08 08:01:57,297 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 08:01:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 767 transitions. [2025-02-08 08:01:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 08:01:57,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:57,298 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:57,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 08:01:57,298 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 08:01:57,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash -349345674, now seen corresponding path program 1 times [2025-02-08 08:01:57,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:57,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114060859] [2025-02-08 08:01:57,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:57,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:57,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:01:57,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:01:57,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:57,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:57,372 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 08:01:57,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:57,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114060859] [2025-02-08 08:01:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114060859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:57,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:01:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605162252] [2025-02-08 08:01:57,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:57,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:57,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:57,375 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 08:01:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:57,854 INFO L93 Difference]: Finished difference Result 696 states and 820 transitions. [2025-02-08 08:01:57,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:01:57,854 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 08:01:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:57,857 INFO L225 Difference]: With dead ends: 696 [2025-02-08 08:01:57,858 INFO L226 Difference]: Without dead ends: 696 [2025-02-08 08:01:57,858 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 08:01:57,860 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 965 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 08:01:57,861 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 08:01:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-02-08 08:01:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 647. [2025-02-08 08:01:57,873 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 08:01:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 744 transitions. [2025-02-08 08:01:57,876 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 744 transitions. Word has length 10 [2025-02-08 08:01:57,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:57,876 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 744 transitions. [2025-02-08 08:01:57,876 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 08:01:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 744 transitions. [2025-02-08 08:01:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 08:01:57,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:57,876 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:57,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 08:01:57,877 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 08:01:57,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:57,877 INFO L85 PathProgramCache]: Analyzing trace with hash -349345673, now seen corresponding path program 1 times [2025-02-08 08:01:57,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:57,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038674466] [2025-02-08 08:01:57,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:57,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:57,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 08:01:57,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 08:01:57,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:57,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:57,952 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 08:01:57,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:57,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038674466] [2025-02-08 08:01:57,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038674466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:57,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:57,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:01:57,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109521371] [2025-02-08 08:01:57,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:57,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:57,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:57,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:57,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:57,955 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 08:01:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:57,989 INFO L93 Difference]: Finished difference Result 572 states and 641 transitions. [2025-02-08 08:01:57,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:57,990 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 08:01:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:57,991 INFO L225 Difference]: With dead ends: 572 [2025-02-08 08:01:57,992 INFO L226 Difference]: Without dead ends: 572 [2025-02-08 08:01:57,992 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 08:01:57,992 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 08:01:57,993 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 08:01:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-08 08:01:57,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2025-02-08 08:01:58,001 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 08:01:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 641 transitions. [2025-02-08 08:01:58,005 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 641 transitions. Word has length 10 [2025-02-08 08:01:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:58,005 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 641 transitions. [2025-02-08 08:01:58,006 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 08:01:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 641 transitions. [2025-02-08 08:01:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 08:01:58,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:58,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:01:58,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 08:01:58,009 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 08:01:58,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2055061787, now seen corresponding path program 1 times [2025-02-08 08:01:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:58,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805438243] [2025-02-08 08:01:58,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:58,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 08:01:58,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 08:01:58,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:58,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:58,071 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 08:01:58,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:58,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805438243] [2025-02-08 08:01:58,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805438243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:58,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:58,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:01:58,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378696960] [2025-02-08 08:01:58,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:58,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:58,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:58,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:58,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:58,072 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 08:01:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:58,131 INFO L93 Difference]: Finished difference Result 554 states and 616 transitions. [2025-02-08 08:01:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:01:58,132 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 08:01:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:58,133 INFO L225 Difference]: With dead ends: 554 [2025-02-08 08:01:58,133 INFO L226 Difference]: Without dead ends: 554 [2025-02-08 08:01:58,133 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 08:01:58,134 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:58,134 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.0s Time] [2025-02-08 08:01:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-02-08 08:01:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2025-02-08 08:01:58,143 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 08:01:58,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 613 transitions. [2025-02-08 08:01:58,145 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 613 transitions. Word has length 11 [2025-02-08 08:01:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:58,145 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 613 transitions. [2025-02-08 08:01:58,145 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 08:01:58,146 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 613 transitions. [2025-02-08 08:01:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 08:01:58,146 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:58,146 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 08:01:58,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 08:01:58,146 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 08:01:58,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1039576559, now seen corresponding path program 1 times [2025-02-08 08:01:58,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:58,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976590479] [2025-02-08 08:01:58,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:58,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:58,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 08:01:58,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 08:01:58,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:58,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:58,299 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 08:01:58,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:58,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976590479] [2025-02-08 08:01:58,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976590479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:58,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:58,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 08:01:58,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979212834] [2025-02-08 08:01:58,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:58,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:58,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:58,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:58,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:58,301 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 08:01:58,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:58,707 INFO L93 Difference]: Finished difference Result 605 states and 695 transitions. [2025-02-08 08:01:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 08:01:58,707 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 08:01:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:58,709 INFO L225 Difference]: With dead ends: 605 [2025-02-08 08:01:58,709 INFO L226 Difference]: Without dead ends: 605 [2025-02-08 08:01:58,709 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 08:01:58,710 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 471 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:01:58,710 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.4s Time] [2025-02-08 08:01:58,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-02-08 08:01:58,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 547. [2025-02-08 08:01:58,716 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 08:01:58,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 609 transitions. [2025-02-08 08:01:58,718 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 609 transitions. Word has length 25 [2025-02-08 08:01:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:58,718 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 609 transitions. [2025-02-08 08:01:58,718 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 08:01:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 609 transitions. [2025-02-08 08:01:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-08 08:01:58,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:58,719 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 08:01:58,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 08:01:58,719 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 08:01:58,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:58,720 INFO L85 PathProgramCache]: Analyzing trace with hash -592977163, now seen corresponding path program 1 times [2025-02-08 08:01:58,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:58,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944855472] [2025-02-08 08:01:58,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:58,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:58,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 08:01:58,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 08:01:58,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:58,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:58,830 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 08:01:58,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:58,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944855472] [2025-02-08 08:01:58,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944855472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:58,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:58,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:01:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694796884] [2025-02-08 08:01:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:58,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 08:01:58,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:58,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 08:01:58,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 08:01:58,836 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 08:01:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:58,915 INFO L93 Difference]: Finished difference Result 547 states and 605 transitions. [2025-02-08 08:01:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 08:01:58,915 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 08:01:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:58,920 INFO L225 Difference]: With dead ends: 547 [2025-02-08 08:01:58,920 INFO L226 Difference]: Without dead ends: 547 [2025-02-08 08:01:58,920 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 08:01:58,920 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 21 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 08:01:58,921 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 08:01:58,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-02-08 08:01:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 547. [2025-02-08 08:01:58,934 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 08:01:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 605 transitions. [2025-02-08 08:01:58,935 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 605 transitions. Word has length 60 [2025-02-08 08:01:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:58,935 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 605 transitions. [2025-02-08 08:01:58,936 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 08:01:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 605 transitions. [2025-02-08 08:01:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-08 08:01:58,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:58,936 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 08:01:58,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 08:01:58,937 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 08:01:58,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash 386878253, now seen corresponding path program 1 times [2025-02-08 08:01:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858799796] [2025-02-08 08:01:58,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:58,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 08:01:58,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 08:01:58,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:58,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:59,079 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 08:01:59,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:59,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858799796] [2025-02-08 08:01:59,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858799796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:59,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:59,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 08:01:59,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924339321] [2025-02-08 08:01:59,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:59,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 08:01:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:59,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 08:01:59,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 08:01:59,085 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 08:01:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:01:59,163 INFO L93 Difference]: Finished difference Result 639 states and 724 transitions. [2025-02-08 08:01:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 08:01:59,163 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 08:01:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:01:59,168 INFO L225 Difference]: With dead ends: 639 [2025-02-08 08:01:59,168 INFO L226 Difference]: Without dead ends: 639 [2025-02-08 08:01:59,169 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 08:01:59,169 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 54 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 08:01:59,169 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 08:01:59,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-08 08:01:59,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-02-08 08:01:59,176 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 08:01:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 724 transitions. [2025-02-08 08:01:59,177 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 724 transitions. Word has length 68 [2025-02-08 08:01:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:01:59,178 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 724 transitions. [2025-02-08 08:01:59,178 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 08:01:59,178 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 724 transitions. [2025-02-08 08:01:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 08:01:59,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:01:59,179 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 08:01:59,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 08:01:59,179 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 08:01:59,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:01:59,179 INFO L85 PathProgramCache]: Analyzing trace with hash 935466296, now seen corresponding path program 1 times [2025-02-08 08:01:59,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:01:59,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62891108] [2025-02-08 08:01:59,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:01:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:01:59,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 08:01:59,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 08:01:59,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:01:59,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:01:59,593 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 08:01:59,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:01:59,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62891108] [2025-02-08 08:01:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62891108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:01:59,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:01:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:01:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117000513] [2025-02-08 08:01:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:01:59,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:01:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:01:59,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:01:59,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:01:59,597 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 08:02:00,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:00,132 INFO L93 Difference]: Finished difference Result 638 states and 723 transitions. [2025-02-08 08:02:00,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:02:00,132 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 08:02:00,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:00,135 INFO L225 Difference]: With dead ends: 638 [2025-02-08 08:02:00,135 INFO L226 Difference]: Without dead ends: 638 [2025-02-08 08:02:00,135 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 08:02:00,136 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 08:02:00,136 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 08:02:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-02-08 08:02:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2025-02-08 08:02:00,167 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 08:02:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 723 transitions. [2025-02-08 08:02:00,169 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 723 transitions. Word has length 76 [2025-02-08 08:02:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:00,169 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 723 transitions. [2025-02-08 08:02:00,169 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 08:02:00,170 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 723 transitions. [2025-02-08 08:02:00,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-02-08 08:02:00,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:00,171 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 08:02:00,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 08:02:00,171 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 08:02:00,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 935466297, now seen corresponding path program 1 times [2025-02-08 08:02:00,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311831379] [2025-02-08 08:02:00,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:00,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-02-08 08:02:00,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-02-08 08:02:00,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:00,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:00,498 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 08:02:00,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:00,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311831379] [2025-02-08 08:02:00,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311831379] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:00,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:00,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 08:02:00,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85653486] [2025-02-08 08:02:00,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:00,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 08:02:00,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:00,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 08:02:00,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 08:02:00,500 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 08:02:00,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:00,962 INFO L93 Difference]: Finished difference Result 637 states and 722 transitions. [2025-02-08 08:02:00,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:02:00,962 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 08:02:00,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:00,964 INFO L225 Difference]: With dead ends: 637 [2025-02-08 08:02:00,964 INFO L226 Difference]: Without dead ends: 637 [2025-02-08 08:02:00,964 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 08:02:00,965 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 1 mSDsluCounter, 1012 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:00,965 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.4s Time] [2025-02-08 08:02:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-02-08 08:02:00,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2025-02-08 08:02:00,971 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 08:02:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 722 transitions. [2025-02-08 08:02:00,972 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 722 transitions. Word has length 76 [2025-02-08 08:02:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:00,972 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 722 transitions. [2025-02-08 08:02:00,973 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 08:02:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 722 transitions. [2025-02-08 08:02:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 08:02:00,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:00,973 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 08:02:00,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 08:02:00,974 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 08:02:00,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:00,974 INFO L85 PathProgramCache]: Analyzing trace with hash 747511445, now seen corresponding path program 1 times [2025-02-08 08:02:00,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:00,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528322929] [2025-02-08 08:02:00,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:00,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:00,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 08:02:01,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 08:02:01,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:01,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:01,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 08:02:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:01,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528322929] [2025-02-08 08:02:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528322929] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:01,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:01,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 08:02:01,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339265570] [2025-02-08 08:02:01,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:01,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 08:02:01,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:01,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 08:02:01,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:02:01,161 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 08:02:01,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:01,644 INFO L93 Difference]: Finished difference Result 649 states and 737 transitions. [2025-02-08 08:02:01,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 08:02:01,644 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 08:02:01,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:01,647 INFO L225 Difference]: With dead ends: 649 [2025-02-08 08:02:01,647 INFO L226 Difference]: Without dead ends: 649 [2025-02-08 08:02:01,647 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 08:02:01,648 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 10 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:01,648 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.5s Time] [2025-02-08 08:02:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-08 08:02:01,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 643. [2025-02-08 08:02:01,654 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 08:02:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 732 transitions. [2025-02-08 08:02:01,655 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 732 transitions. Word has length 84 [2025-02-08 08:02:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:01,656 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 732 transitions. [2025-02-08 08:02:01,656 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 08:02:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 732 transitions. [2025-02-08 08:02:01,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-08 08:02:01,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:01,657 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 08:02:01,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 08:02:01,657 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 08:02:01,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:01,657 INFO L85 PathProgramCache]: Analyzing trace with hash 747511446, now seen corresponding path program 1 times [2025-02-08 08:02:01,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:01,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225049752] [2025-02-08 08:02:01,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:01,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:01,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-08 08:02:01,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-08 08:02:01,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:01,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:02,020 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 08:02:02,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:02,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225049752] [2025-02-08 08:02:02,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225049752] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:02,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:02,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:02:02,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625823305] [2025-02-08 08:02:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:02,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:02:02,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:02,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:02:02,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:02:02,021 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 08:02:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:02,543 INFO L93 Difference]: Finished difference Result 643 states and 731 transitions. [2025-02-08 08:02:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:02:02,543 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 08:02:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:02,545 INFO L225 Difference]: With dead ends: 643 [2025-02-08 08:02:02,545 INFO L226 Difference]: Without dead ends: 643 [2025-02-08 08:02:02,545 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 08:02:02,546 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 5 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:02,546 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.5s Time] [2025-02-08 08:02:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2025-02-08 08:02:02,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 643. [2025-02-08 08:02:02,553 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 08:02:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 731 transitions. [2025-02-08 08:02:02,555 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 731 transitions. Word has length 84 [2025-02-08 08:02:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:02,555 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 731 transitions. [2025-02-08 08:02:02,555 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 08:02:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 731 transitions. [2025-02-08 08:02:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 08:02:02,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:02,556 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 08:02:02,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 08:02:02,556 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 08:02:02,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:02,556 INFO L85 PathProgramCache]: Analyzing trace with hash -151045995, now seen corresponding path program 1 times [2025-02-08 08:02:02,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:02,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436291897] [2025-02-08 08:02:02,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:02,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 08:02:02,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 08:02:02,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:02,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:02,934 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 08:02:02,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436291897] [2025-02-08 08:02:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436291897] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:02,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904051334] [2025-02-08 08:02:02,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:02,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:02,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:02,941 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 08:02:02,942 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 08:02:03,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 08:02:03,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 08:02:03,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:03,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:03,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 08:02:03,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:03,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:03,192 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 08:02:03,206 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 08:02:03,256 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:03,257 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 08:02:03,280 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 08:02:03,282 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 08:02:03,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:03,320 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-08 08:02:03,321 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 08:02:03,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904051334] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:03,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:03,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 13 [2025-02-08 08:02:03,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119726223] [2025-02-08 08:02:03,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:03,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:02:03,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:03,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:02:03,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=169, Unknown=6, NotChecked=0, Total=210 [2025-02-08 08:02:03,353 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 08:02:04,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:04,618 INFO L93 Difference]: Finished difference Result 642 states and 730 transitions. [2025-02-08 08:02:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:02:04,619 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 08:02:04,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:04,620 INFO L225 Difference]: With dead ends: 642 [2025-02-08 08:02:04,621 INFO L226 Difference]: Without dead ends: 642 [2025-02-08 08:02:04,621 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 08:02:04,623 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 519 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2836 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:04,623 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.2s Time] [2025-02-08 08:02:04,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-02-08 08:02:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2025-02-08 08:02:04,629 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 08:02:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 730 transitions. [2025-02-08 08:02:04,630 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 730 transitions. Word has length 85 [2025-02-08 08:02:04,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:04,630 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 730 transitions. [2025-02-08 08:02:04,630 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 08:02:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 730 transitions. [2025-02-08 08:02:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-08 08:02:04,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:04,631 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 08:02:04,641 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 08:02:04,832 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 08:02:04,832 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 08:02:04,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:04,833 INFO L85 PathProgramCache]: Analyzing trace with hash -151045994, now seen corresponding path program 1 times [2025-02-08 08:02:04,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:04,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269537078] [2025-02-08 08:02:04,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:04,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:04,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 08:02:04,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 08:02:04,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:04,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:05,359 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 08:02:05,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:05,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269537078] [2025-02-08 08:02:05,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269537078] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:05,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493998239] [2025-02-08 08:02:05,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:05,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:05,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:05,362 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 08:02:05,363 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 08:02:05,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-08 08:02:05,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-08 08:02:05,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:05,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:05,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 08:02:05,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:05,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:05,603 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 08:02:05,606 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 08:02:05,616 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 08:02:05,620 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 08:02:05,673 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 08:02:05,678 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 08:02:05,769 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:05,769 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 08:02:05,774 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 08:02:05,799 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 08:02:05,804 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 08:02:05,806 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 08:02:05,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:05,882 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 08:02:05,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493998239] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:05,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:05,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2025-02-08 08:02:05,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349211364] [2025-02-08 08:02:05,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:05,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 08:02:05,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:05,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 08:02:05,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=225, Unknown=1, NotChecked=30, Total=306 [2025-02-08 08:02:05,886 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 08:02:07,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:07,605 INFO L93 Difference]: Finished difference Result 649 states and 737 transitions. [2025-02-08 08:02:07,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 08:02:07,606 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 08:02:07,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:07,608 INFO L225 Difference]: With dead ends: 649 [2025-02-08 08:02:07,608 INFO L226 Difference]: Without dead ends: 649 [2025-02-08 08:02:07,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=345, Unknown=1, NotChecked=38, Total=462 [2025-02-08 08:02:07,609 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.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:07,609 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.6s Time] [2025-02-08 08:02:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-02-08 08:02:07,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 640. [2025-02-08 08:02:07,615 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 08:02:07,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2025-02-08 08:02:07,616 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 725 transitions. Word has length 85 [2025-02-08 08:02:07,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:07,616 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 725 transitions. [2025-02-08 08:02:07,616 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 08:02:07,616 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 725 transitions. [2025-02-08 08:02:07,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 08:02:07,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:07,617 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 08:02:07,624 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 08:02:07,821 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 08:02:07,821 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 08:02:07,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:07,822 INFO L85 PathProgramCache]: Analyzing trace with hash -291474371, now seen corresponding path program 1 times [2025-02-08 08:02:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:07,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037307699] [2025-02-08 08:02:07,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:07,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 08:02:07,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 08:02:07,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:07,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:08,171 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 08:02:08,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:08,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037307699] [2025-02-08 08:02:08,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037307699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:08,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:08,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 08:02:08,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133341092] [2025-02-08 08:02:08,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:08,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 08:02:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:08,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 08:02:08,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-08 08:02:08,173 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 08:02:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:09,227 INFO L93 Difference]: Finished difference Result 653 states and 741 transitions. [2025-02-08 08:02:09,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:02:09,228 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 08:02:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:09,230 INFO L225 Difference]: With dead ends: 653 [2025-02-08 08:02:09,231 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 08:02:09,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-02-08 08:02:09,231 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 08:02:09,232 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 08:02:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 08:02:09,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 649. [2025-02-08 08:02:09,239 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 08:02:09,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 736 transitions. [2025-02-08 08:02:09,240 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 736 transitions. Word has length 87 [2025-02-08 08:02:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:09,240 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 736 transitions. [2025-02-08 08:02:09,240 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 08:02:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 736 transitions. [2025-02-08 08:02:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-08 08:02:09,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:09,241 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 08:02:09,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 08:02:09,241 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 08:02:09,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash -291474370, now seen corresponding path program 1 times [2025-02-08 08:02:09,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:09,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074081552] [2025-02-08 08:02:09,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:09,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-08 08:02:09,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-08 08:02:09,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:09,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:09,936 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 08:02:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:09,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074081552] [2025-02-08 08:02:09,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074081552] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:09,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:09,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 08:02:09,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927899094] [2025-02-08 08:02:09,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:09,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:02:09,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:09,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:02:09,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 08:02:09,942 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 08:02:11,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:11,111 INFO L93 Difference]: Finished difference Result 652 states and 740 transitions. [2025-02-08 08:02:11,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 08:02:11,111 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 08:02:11,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:11,117 INFO L225 Difference]: With dead ends: 652 [2025-02-08 08:02:11,117 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 08:02:11,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:02:11,118 INFO L435 NwaCegarLoop]: 339 mSDtfsCounter, 518 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:11,118 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.1s Time] [2025-02-08 08:02:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 08:02:11,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 649. [2025-02-08 08:02:11,130 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 08:02:11,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 735 transitions. [2025-02-08 08:02:11,134 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 735 transitions. Word has length 87 [2025-02-08 08:02:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:11,135 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 735 transitions. [2025-02-08 08:02:11,135 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 08:02:11,135 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 735 transitions. [2025-02-08 08:02:11,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 08:02:11,135 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:11,135 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 08:02:11,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 08:02:11,135 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 08:02:11,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1314986557, now seen corresponding path program 1 times [2025-02-08 08:02:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:11,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905523487] [2025-02-08 08:02:11,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:11,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:11,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 08:02:11,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 08:02:11,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:11,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:11,563 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 08:02:11,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:11,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905523487] [2025-02-08 08:02:11,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905523487] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:11,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657462830] [2025-02-08 08:02:11,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:11,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:11,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:11,568 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 08:02:11,572 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 08:02:11,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 08:02:11,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 08:02:11,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:11,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:11,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-08 08:02:11,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:11,813 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 08:02:11,884 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:11,884 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 08:02:11,888 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 08:02:11,942 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:11,943 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 08:02:11,986 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:11,986 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 08:02:11,994 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 08:02:11,996 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 08:02:11,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:12,087 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2025-02-08 08:02:12,088 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 08:02:12,093 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 08:02:12,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657462830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:12,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:12,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 16 [2025-02-08 08:02:12,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503143029] [2025-02-08 08:02:12,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:12,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 08:02:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:12,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 08:02:12,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=278, Unknown=13, NotChecked=34, Total=380 [2025-02-08 08:02:12,098 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 08:02:13,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:13,404 INFO L93 Difference]: Finished difference Result 651 states and 739 transitions. [2025-02-08 08:02:13,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:02:13,405 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 08:02:13,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:13,406 INFO L225 Difference]: With dead ends: 651 [2025-02-08 08:02:13,406 INFO L226 Difference]: Without dead ends: 651 [2025-02-08 08:02:13,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=526, Unknown=18, NotChecked=48, Total=702 [2025-02-08 08:02:13,407 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 489 mSDsluCounter, 3736 mSDsCounter, 0 mSdLazyCounter, 3614 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:13,407 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.2s Time] [2025-02-08 08:02:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-08 08:02:13,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 648. [2025-02-08 08:02:13,413 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 08:02:13,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 734 transitions. [2025-02-08 08:02:13,414 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 734 transitions. Word has length 88 [2025-02-08 08:02:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:13,414 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 734 transitions. [2025-02-08 08:02:13,414 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 08:02:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 734 transitions. [2025-02-08 08:02:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-08 08:02:13,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:13,415 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 08:02:13,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 08:02:13,619 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 08:02:13,619 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 08:02:13,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1314986558, now seen corresponding path program 1 times [2025-02-08 08:02:13,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:13,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829065318] [2025-02-08 08:02:13,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:13,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:13,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 08:02:13,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 08:02:13,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:13,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:14,080 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 08:02:14,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:14,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829065318] [2025-02-08 08:02:14,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829065318] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:14,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568458141] [2025-02-08 08:02:14,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:14,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:14,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:14,083 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 08:02:14,090 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 08:02:14,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-08 08:02:14,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-08 08:02:14,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:14,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:14,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 08:02:14,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:14,232 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 08:02:14,315 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 08:02:14,320 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:14,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:02:14,329 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 08:02:14,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 08:02:14,366 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 08:02:14,369 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 08:02:14,433 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:14,433 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 08:02:14,436 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 08:02:14,482 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:14,483 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 08:02:14,487 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 08:02:14,497 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 08:02:14,499 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 08:02:14,501 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 08:02:14,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:14,578 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 08:02:14,612 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 08:02:14,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568458141] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:14,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:14,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2025-02-08 08:02:14,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454399457] [2025-02-08 08:02:14,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:14,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:02:14,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:14,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:02:14,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=275, Unknown=14, NotChecked=70, Total=420 [2025-02-08 08:02:14,615 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 08:02:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:16,185 INFO L93 Difference]: Finished difference Result 650 states and 738 transitions. [2025-02-08 08:02:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 08:02:16,185 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 08:02:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:16,187 INFO L225 Difference]: With dead ends: 650 [2025-02-08 08:02:16,187 INFO L226 Difference]: Without dead ends: 650 [2025-02-08 08:02:16,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=447, Unknown=15, NotChecked=90, Total=650 [2025-02-08 08:02:16,187 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 491 mSDsluCounter, 2677 mSDsCounter, 0 mSdLazyCounter, 3517 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:16,188 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.5s Time] [2025-02-08 08:02:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-02-08 08:02:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 638. [2025-02-08 08:02:16,193 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 08:02:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 723 transitions. [2025-02-08 08:02:16,194 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 723 transitions. Word has length 88 [2025-02-08 08:02:16,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:16,194 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 723 transitions. [2025-02-08 08:02:16,194 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 08:02:16,194 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 723 transitions. [2025-02-08 08:02:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 08:02:16,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:16,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 08:02:16,201 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 08:02:16,395 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 08:02:16,395 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 08:02:16,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1111376494, now seen corresponding path program 1 times [2025-02-08 08:02:16,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:16,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490300664] [2025-02-08 08:02:16,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:16,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:16,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 08:02:16,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 08:02:16,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:16,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:16,756 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 08:02:16,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:16,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490300664] [2025-02-08 08:02:16,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490300664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:16,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:16,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 08:02:16,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465983835] [2025-02-08 08:02:16,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:16,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 08:02:16,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:16,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 08:02:16,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:02:16,758 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 08:02:17,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:17,949 INFO L93 Difference]: Finished difference Result 654 states and 742 transitions. [2025-02-08 08:02:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:02:17,950 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 08:02:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:17,951 INFO L225 Difference]: With dead ends: 654 [2025-02-08 08:02:17,952 INFO L226 Difference]: Without dead ends: 654 [2025-02-08 08:02:17,952 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 08:02:17,953 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 503 mSDsluCounter, 3126 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.1s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:17,953 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.1s Time] [2025-02-08 08:02:17,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-08 08:02:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 650. [2025-02-08 08:02:17,958 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 08:02:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 737 transitions. [2025-02-08 08:02:17,959 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 737 transitions. Word has length 90 [2025-02-08 08:02:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:17,959 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 737 transitions. [2025-02-08 08:02:17,959 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 08:02:17,959 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 737 transitions. [2025-02-08 08:02:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-02-08 08:02:17,960 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:17,960 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 08:02:17,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 08:02:17,960 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 08:02:17,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:17,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1111376495, now seen corresponding path program 1 times [2025-02-08 08:02:17,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:17,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14988958] [2025-02-08 08:02:17,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:17,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:17,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-02-08 08:02:17,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-02-08 08:02:17,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:17,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:18,486 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 08:02:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14988958] [2025-02-08 08:02:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14988958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:18,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 08:02:18,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473950149] [2025-02-08 08:02:18,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:18,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 08:02:18,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:18,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 08:02:18,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-08 08:02:18,488 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 08:02:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:20,062 INFO L93 Difference]: Finished difference Result 653 states and 741 transitions. [2025-02-08 08:02:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 08:02:20,063 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 08:02:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:20,064 INFO L225 Difference]: With dead ends: 653 [2025-02-08 08:02:20,064 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 08:02:20,065 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 08:02:20,069 INFO L435 NwaCegarLoop]: 338 mSDtfsCounter, 502 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 2902 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:20,069 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.5s Time] [2025-02-08 08:02:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 08:02:20,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2025-02-08 08:02:20,079 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 08:02:20,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 736 transitions. [2025-02-08 08:02:20,080 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 736 transitions. Word has length 90 [2025-02-08 08:02:20,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:20,080 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 736 transitions. [2025-02-08 08:02:20,080 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 08:02:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 736 transitions. [2025-02-08 08:02:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 08:02:20,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:20,081 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 08:02:20,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 08:02:20,081 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 08:02:20,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:20,081 INFO L85 PathProgramCache]: Analyzing trace with hash 368303214, now seen corresponding path program 1 times [2025-02-08 08:02:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408410035] [2025-02-08 08:02:20,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:20,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 08:02:20,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 08:02:20,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:20,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:20,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 08:02:20,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:20,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408410035] [2025-02-08 08:02:20,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408410035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:20,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365208889] [2025-02-08 08:02:20,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:20,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:20,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:20,455 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 08:02:20,457 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 08:02:20,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 08:02:20,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 08:02:20,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:20,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:20,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 08:02:20,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:20,620 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 08:02:20,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:20,688 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 08:02:20,693 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 08:02:20,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:20,751 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 08:02:20,783 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:20,783 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 08:02:20,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:20,816 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 08:02:20,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 08:02:20,826 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 08:02:20,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:20,879 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 08:02:24,955 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2025-02-08 08:02:24,955 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 08:02:24,969 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1256 (Array Int Int)) (v_ArrVal_1253 (Array Int Int)) (v_ArrVal_1252 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1256))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 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)))) is different from false [2025-02-08 08:02:24,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365208889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:24,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 18 [2025-02-08 08:02:24,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831482007] [2025-02-08 08:02:24,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:24,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:02:24,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:24,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:02:24,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=373, Unknown=24, NotChecked=82, Total=552 [2025-02-08 08:02:24,974 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 08:02:26,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:26,328 INFO L93 Difference]: Finished difference Result 652 states and 740 transitions. [2025-02-08 08:02:26,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:02:26,331 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 08:02:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:26,332 INFO L225 Difference]: With dead ends: 652 [2025-02-08 08:02:26,332 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 08:02:26,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=144, Invalid=709, Unknown=25, NotChecked=114, Total=992 [2025-02-08 08:02:26,336 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 491 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:26,336 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.2s Time] [2025-02-08 08:02:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 08:02:26,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 649. [2025-02-08 08:02:26,346 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 08:02:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 735 transitions. [2025-02-08 08:02:26,347 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 735 transitions. Word has length 91 [2025-02-08 08:02:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:26,347 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 735 transitions. [2025-02-08 08:02:26,347 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 08:02:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 735 transitions. [2025-02-08 08:02:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-08 08:02:26,348 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:26,348 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 08:02:26,355 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 08:02:26,548 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 08:02:26,549 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 08:02:26,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:26,549 INFO L85 PathProgramCache]: Analyzing trace with hash 368303215, now seen corresponding path program 1 times [2025-02-08 08:02:26,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:26,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968760790] [2025-02-08 08:02:26,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:26,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:26,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 08:02:26,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 08:02:26,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:26,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:27,271 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 08:02:27,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:27,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968760790] [2025-02-08 08:02:27,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968760790] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:27,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540254338] [2025-02-08 08:02:27,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:27,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:27,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:27,273 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 08:02:27,277 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 08:02:27,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-08 08:02:27,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-08 08:02:27,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:27,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:27,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 08:02:27,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:27,436 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 08:02:27,521 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:27,522 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 08:02:27,525 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 08:02:27,531 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 08:02:27,536 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 08:02:27,575 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 08:02:27,578 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 08:02:27,753 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:27,754 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 08:02:27,758 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 08:02:27,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:27,812 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 08:02:27,816 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 08:02:27,880 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:27,880 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 08:02:27,887 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 08:02:27,907 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 08:02:27,917 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 08:02:27,917 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 08:02:27,917 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:27,966 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 08:02:27,974 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 08:02:28,008 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 08:02:28,036 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 08:02:28,107 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 08:02:28,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540254338] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:28,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:28,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2025-02-08 08:02:28,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435005281] [2025-02-08 08:02:28,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:28,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:02:28,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:28,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:02:28,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=321, Unknown=5, NotChecked=200, Total=600 [2025-02-08 08:02:28,109 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 08:02:29,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:29,552 INFO L93 Difference]: Finished difference Result 651 states and 739 transitions. [2025-02-08 08:02:29,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:02:29,552 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 08:02:29,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:29,554 INFO L225 Difference]: With dead ends: 651 [2025-02-08 08:02:29,554 INFO L226 Difference]: Without dead ends: 651 [2025-02-08 08:02:29,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=546, Unknown=5, NotChecked=260, Total=930 [2025-02-08 08:02:29,555 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 492 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:29,556 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.3s Time] [2025-02-08 08:02:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2025-02-08 08:02:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 636. [2025-02-08 08:02:29,561 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 08:02:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 721 transitions. [2025-02-08 08:02:29,565 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 721 transitions. Word has length 91 [2025-02-08 08:02:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:29,565 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 721 transitions. [2025-02-08 08:02:29,566 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 08:02:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 721 transitions. [2025-02-08 08:02:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 08:02:29,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:29,566 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 08:02:29,577 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 08:02:29,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 08:02:29,767 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 08:02:29,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash -885268618, now seen corresponding path program 1 times [2025-02-08 08:02:29,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:29,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705956459] [2025-02-08 08:02:29,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:29,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:29,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:02:29,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:02:29,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:29,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:30,252 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 08:02:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705956459] [2025-02-08 08:02:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705956459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:30,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:30,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 08:02:30,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927794339] [2025-02-08 08:02:30,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:30,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:02:30,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:30,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:02:30,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:02:30,254 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 08:02:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:31,386 INFO L93 Difference]: Finished difference Result 655 states and 743 transitions. [2025-02-08 08:02:31,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:02:31,386 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 08:02:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:31,388 INFO L225 Difference]: With dead ends: 655 [2025-02-08 08:02:31,388 INFO L226 Difference]: Without dead ends: 655 [2025-02-08 08:02:31,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-02-08 08:02:31,388 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 510 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 2327 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:31,389 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.0s Time] [2025-02-08 08:02:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-08 08:02:31,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 651. [2025-02-08 08:02:31,393 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 08:02:31,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 738 transitions. [2025-02-08 08:02:31,394 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 738 transitions. Word has length 93 [2025-02-08 08:02:31,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:31,394 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 738 transitions. [2025-02-08 08:02:31,394 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 08:02:31,394 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 738 transitions. [2025-02-08 08:02:31,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-08 08:02:31,395 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:31,395 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 08:02:31,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 08:02:31,395 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 08:02:31,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash -885268617, now seen corresponding path program 1 times [2025-02-08 08:02:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:31,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97749570] [2025-02-08 08:02:31,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:31,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-08 08:02:31,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-08 08:02:31,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:31,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:31,929 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 08:02:31,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:31,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97749570] [2025-02-08 08:02:31,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97749570] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:31,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:31,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-08 08:02:31,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365418214] [2025-02-08 08:02:31,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:31,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 08:02:31,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:31,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 08:02:31,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-08 08:02:31,931 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 08:02:33,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:33,149 INFO L93 Difference]: Finished difference Result 654 states and 742 transitions. [2025-02-08 08:02:33,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:02:33,149 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 08:02:33,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:33,151 INFO L225 Difference]: With dead ends: 654 [2025-02-08 08:02:33,151 INFO L226 Difference]: Without dead ends: 654 [2025-02-08 08:02:33,151 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 08:02:33,151 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 08:02:33,151 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 08:02:33,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-08 08:02:33,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 651. [2025-02-08 08:02:33,156 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 08:02:33,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 737 transitions. [2025-02-08 08:02:33,156 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 737 transitions. Word has length 93 [2025-02-08 08:02:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:33,156 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 737 transitions. [2025-02-08 08:02:33,157 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 08:02:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 737 transitions. [2025-02-08 08:02:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 08:02:33,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:33,161 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 08:02:33,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 08:02:33,161 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 08:02:33,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1519909514, now seen corresponding path program 1 times [2025-02-08 08:02:33,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:33,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710848668] [2025-02-08 08:02:33,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:33,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:33,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 08:02:33,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 08:02:33,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:33,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:33,574 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 08:02:33,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:33,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710848668] [2025-02-08 08:02:33,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710848668] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:33,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102576939] [2025-02-08 08:02:33,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:33,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:33,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:33,578 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 08:02:33,579 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 08:02:33,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 08:02:33,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 08:02:33,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:33,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:33,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 08:02:33,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:33,759 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 08:02:33,853 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:33,854 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 08:02:33,861 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 08:02:33,930 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:33,931 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 08:02:33,972 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:33,972 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 08:02:34,014 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:34,014 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 08:02:34,061 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:34,064 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 08:02:34,082 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 08:02:34,084 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 08:02:34,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:34,102 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1713) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2025-02-08 08:02:34,150 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 08:02:34,383 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| (select (select |c_#memory_$Pointer$#1.base| |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))) 1)) is different from false [2025-02-08 08:02:34,436 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2025-02-08 08:02:34,436 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 08:02:34,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102576939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:34,504 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:34,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 20 [2025-02-08 08:02:34,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654062728] [2025-02-08 08:02:34,504 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:34,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 08:02:34,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:34,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 08:02:34,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=488, Unknown=31, NotChecked=144, Total=756 [2025-02-08 08:02:34,508 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 08:02:35,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:35,680 INFO L93 Difference]: Finished difference Result 653 states and 741 transitions. [2025-02-08 08:02:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:02:35,680 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 08:02:35,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:35,682 INFO L225 Difference]: With dead ends: 653 [2025-02-08 08:02:35,682 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 08:02:35,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=925, Unknown=31, NotChecked=198, Total=1332 [2025-02-08 08:02:35,685 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 493 mSDsluCounter, 2186 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:35,685 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.0s Time] [2025-02-08 08:02:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 08:02:35,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2025-02-08 08:02:35,691 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 08:02:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 736 transitions. [2025-02-08 08:02:35,692 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 736 transitions. Word has length 94 [2025-02-08 08:02:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:35,693 INFO L471 AbstractCegarLoop]: Abstraction has 650 states and 736 transitions. [2025-02-08 08:02:35,693 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 08:02:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 736 transitions. [2025-02-08 08:02:35,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-08 08:02:35,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:35,693 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 08:02:35,702 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 08:02:35,894 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 08:02:35,894 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 08:02:35,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:35,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1519909513, now seen corresponding path program 1 times [2025-02-08 08:02:35,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:35,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570662823] [2025-02-08 08:02:35,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:35,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:35,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 08:02:35,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 08:02:35,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:35,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:36,448 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 08:02:36,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:36,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570662823] [2025-02-08 08:02:36,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570662823] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:36,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295932007] [2025-02-08 08:02:36,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:36,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:36,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:36,457 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 08:02:36,459 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 08:02:36,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 08:02:36,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 08:02:36,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:36,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:36,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 08:02:36,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:36,668 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 08:02:36,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:36,757 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 08:02:36,761 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 08:02:36,766 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 08:02:36,770 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 08:02:36,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 08:02:36,816 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 08:02:36,901 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:36,901 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 08:02:36,905 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 08:02:36,984 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:36,985 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 08:02:36,992 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 08:02:37,070 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:37,071 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 08:02:37,081 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 08:02:37,133 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:37,133 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 08:02:37,138 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 08:02:37,154 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 08:02:37,160 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 08:02:37,162 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 08:02:37,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:37,223 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1882 (Array Int Int)) (v_ArrVal_1881 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1882) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1881 (Array Int Int))) (<= 0 (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2025-02-08 08:02:37,239 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 08:02:37,257 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 08:02:37,336 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 08:02:38,058 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 08:02:38,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295932007] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:38,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:38,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2025-02-08 08:02:38,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989731793] [2025-02-08 08:02:38,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:38,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 08:02:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:38,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 08:02:38,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=452, Unknown=17, NotChecked=240, Total=812 [2025-02-08 08:02:38,065 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 08:02:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:39,811 INFO L93 Difference]: Finished difference Result 652 states and 740 transitions. [2025-02-08 08:02:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:02:39,811 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 08:02:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:39,813 INFO L225 Difference]: With dead ends: 652 [2025-02-08 08:02:39,813 INFO L226 Difference]: Without dead ends: 652 [2025-02-08 08:02:39,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=169, Invalid=764, Unknown=17, NotChecked=310, Total=1260 [2025-02-08 08:02:39,813 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 491 mSDsluCounter, 2369 mSDsCounter, 0 mSdLazyCounter, 3257 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:39,814 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.6s Time] [2025-02-08 08:02:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2025-02-08 08:02:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 634. [2025-02-08 08:02:39,818 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 08:02:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 719 transitions. [2025-02-08 08:02:39,818 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 719 transitions. Word has length 94 [2025-02-08 08:02:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:39,819 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 719 transitions. [2025-02-08 08:02:39,819 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 08:02:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 719 transitions. [2025-02-08 08:02:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 08:02:39,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:39,819 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 08:02:39,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 08:02:40,020 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 08:02:40,020 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 08:02:40,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash 60072112, now seen corresponding path program 1 times [2025-02-08 08:02:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:40,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273292625] [2025-02-08 08:02:40,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:40,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:40,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 08:02:40,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 08:02:40,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:40,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:40,600 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 08:02:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273292625] [2025-02-08 08:02:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273292625] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:40,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 08:02:40,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526800268] [2025-02-08 08:02:40,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:40,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 08:02:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:40,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 08:02:40,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:02:40,602 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 08:02:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:42,020 INFO L93 Difference]: Finished difference Result 657 states and 745 transitions. [2025-02-08 08:02:42,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:02:42,021 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 08:02:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:42,023 INFO L225 Difference]: With dead ends: 657 [2025-02-08 08:02:42,023 INFO L226 Difference]: Without dead ends: 657 [2025-02-08 08:02:42,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-02-08 08:02:42,025 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 512 mSDsluCounter, 3077 mSDsCounter, 0 mSdLazyCounter, 3161 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:42,025 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.3s Time] [2025-02-08 08:02:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-02-08 08:02:42,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2025-02-08 08:02:42,032 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 08:02:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 740 transitions. [2025-02-08 08:02:42,033 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 740 transitions. Word has length 97 [2025-02-08 08:02:42,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:42,034 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 740 transitions. [2025-02-08 08:02:42,034 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 08:02:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 740 transitions. [2025-02-08 08:02:42,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-08 08:02:42,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:42,034 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 08:02:42,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 08:02:42,035 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 08:02:42,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 60072113, now seen corresponding path program 1 times [2025-02-08 08:02:42,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:42,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401316388] [2025-02-08 08:02:42,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:42,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:42,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-08 08:02:42,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-08 08:02:42,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:42,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:42,831 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 08:02:42,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:42,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401316388] [2025-02-08 08:02:42,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401316388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:42,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:42,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-02-08 08:02:42,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990998540] [2025-02-08 08:02:42,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:42,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 08:02:42,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:42,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 08:02:42,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-02-08 08:02:42,833 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 08:02:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:44,820 INFO L93 Difference]: Finished difference Result 656 states and 744 transitions. [2025-02-08 08:02:44,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 08:02:44,820 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 08:02:44,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:44,822 INFO L225 Difference]: With dead ends: 656 [2025-02-08 08:02:44,822 INFO L226 Difference]: Without dead ends: 656 [2025-02-08 08:02:44,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2025-02-08 08:02:44,823 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 503 mSDsluCounter, 2880 mSDsCounter, 0 mSdLazyCounter, 3944 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.8s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:44,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 3213 Invalid, 3970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3944 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-08 08:02:44,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2025-02-08 08:02:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 653. [2025-02-08 08:02:44,829 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 08:02:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 739 transitions. [2025-02-08 08:02:44,830 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 739 transitions. Word has length 97 [2025-02-08 08:02:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:44,830 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 739 transitions. [2025-02-08 08:02:44,831 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 08:02:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 739 transitions. [2025-02-08 08:02:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 08:02:44,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:44,831 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 08:02:44,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-08 08:02:44,831 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 08:02:44,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -12728656, now seen corresponding path program 1 times [2025-02-08 08:02:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:44,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084288260] [2025-02-08 08:02:44,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:44,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 08:02:44,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 08:02:44,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:44,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:45,358 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 08:02:45,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084288260] [2025-02-08 08:02:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084288260] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:45,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666237283] [2025-02-08 08:02:45,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:45,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:45,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:45,361 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 08:02:45,362 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 08:02:45,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 08:02:45,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 08:02:45,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:45,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:45,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-02-08 08:02:45,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:45,558 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 08:02:45,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:45,638 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 08:02:45,642 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 08:02:45,680 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:45,680 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 08:02:45,702 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:45,702 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 08:02:45,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:45,741 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 08:02:45,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:45,778 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 08:02:45,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:45,816 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 08:02:45,825 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 08:02:45,839 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 08:02:45,839 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 08:02:45,841 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 08:02:45,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:46,374 INFO L349 Elim1Store]: treesize reduction 10, result has 97.5 percent of original size [2025-02-08 08:02:46,374 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 08:02:46,387 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 08:02:46,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666237283] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:46,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:46,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 20 [2025-02-08 08:02:46,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680896160] [2025-02-08 08:02:46,389 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:46,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 08:02:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:46,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 08:02:46,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=753, Unknown=44, NotChecked=58, Total=992 [2025-02-08 08:02:46,390 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 08:02:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:48,277 INFO L93 Difference]: Finished difference Result 655 states and 743 transitions. [2025-02-08 08:02:48,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:02:48,278 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 08:02:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:48,279 INFO L225 Difference]: With dead ends: 655 [2025-02-08 08:02:48,279 INFO L226 Difference]: Without dead ends: 655 [2025-02-08 08:02:48,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=1344, Unknown=44, NotChecked=78, Total=1722 [2025-02-08 08:02:48,280 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 490 mSDsluCounter, 3396 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:48,280 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.7s Time] [2025-02-08 08:02:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-08 08:02:48,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 652. [2025-02-08 08:02:48,284 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 08:02:48,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 738 transitions. [2025-02-08 08:02:48,285 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 738 transitions. Word has length 98 [2025-02-08 08:02:48,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:48,285 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 738 transitions. [2025-02-08 08:02:48,285 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 08:02:48,286 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 738 transitions. [2025-02-08 08:02:48,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-08 08:02:48,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:48,286 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 08:02:48,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 08:02:48,486 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 08:02:48,487 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 08:02:48,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:48,487 INFO L85 PathProgramCache]: Analyzing trace with hash -12728655, now seen corresponding path program 1 times [2025-02-08 08:02:48,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:48,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489274622] [2025-02-08 08:02:48,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:48,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:48,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 08:02:48,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 08:02:48,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:48,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:49,259 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 08:02:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489274622] [2025-02-08 08:02:49,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489274622] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344668703] [2025-02-08 08:02:49,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:49,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:49,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:02:49,263 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 08:02:49,264 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 08:02:49,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-08 08:02:49,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-08 08:02:49,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:49,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:49,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 08:02:49,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:02:49,507 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 08:02:49,611 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 08:02:49,618 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:49,619 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 08:02:49,643 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 08:02:49,646 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 08:02:49,715 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 08:02:49,717 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 08:02:49,835 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:49,835 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 08:02:49,839 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 08:02:49,935 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:49,936 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 08:02:49,939 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 08:02:50,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:50,016 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 08:02:50,020 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 08:02:50,096 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:50,096 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 08:02:50,099 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 08:02:50,174 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:02:50,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 73 treesize of output 66 [2025-02-08 08:02:50,178 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 08:02:50,197 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 08:02:50,202 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 08:02:50,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:02:50,248 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-02-08 08:02:50,248 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 08:02:50,258 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:02:50,258 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 08:02:50,283 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 08:02:50,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:02:51,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (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_2408 (Array Int Int))) (< 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2404))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .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_ULTIMATE.start_main_#t~malloc57#1.base_7| Int) (v_ArrVal_2408 (Array Int Int))) (or (forall ((v_ArrVal_2409 Int)) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2404))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2405))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2403) .cse4 v_ArrVal_2406) .cse5 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 .cse6 .cse5 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 [2025-02-08 08:02:52,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:02:52,858 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 604 treesize of output 622 [2025-02-08 08:02:53,241 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2415 (Array Int Int)) (v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2414 (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 ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2414))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2401))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_2404))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_2415) .cse0 v_ArrVal_2402) .cse1 v_ArrVal_2403) .cse2 v_ArrVal_2406) (select (select (store .cse3 .cse2 v_ArrVal_2405) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_2408))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 1))) (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2409 Int) (v_prenex_19 (Array Int Int)) (v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_25 Int) (v_prenex_24 (Array Int Int)) (v_prenex_23 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_17 (Array Int Int)) (v_prenex_26 (Array Int Int))) (or (= |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_25) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_21))) (let ((.cse7 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse7 v_prenex_24))) (let ((.cse8 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse12 (store .cse13 .cse8 v_prenex_20))) (let ((.cse9 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse11 (store .cse12 .cse9 v_prenex_18))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (< (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_19) .cse7 v_prenex_23) .cse8 v_prenex_22) .cse9 v_prenex_17) .cse10 v_prenex_26) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) 3) (select (store |c_#length| v_prenex_25 v_ArrVal_2409) (select (select (store .cse11 .cse10 v_ArrVal_2407) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))))))) is different from false [2025-02-08 08:02:53,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344668703] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:02:53,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:02:53,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2025-02-08 08:02:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192092466] [2025-02-08 08:02:53,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:02:53,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 08:02:53,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:53,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 08:02:53,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1495, Unknown=47, NotChecked=162, Total=1892 [2025-02-08 08:02:53,248 INFO L87 Difference]: Start difference. First operand 652 states and 738 transitions. Second operand has 32 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 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 08:02:56,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:56,511 INFO L93 Difference]: Finished difference Result 654 states and 742 transitions. [2025-02-08 08:02:56,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 08:02:56,511 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 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 98 [2025-02-08 08:02:56,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:56,513 INFO L225 Difference]: With dead ends: 654 [2025-02-08 08:02:56,513 INFO L226 Difference]: Without dead ends: 654 [2025-02-08 08:02:56,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=324, Invalid=2289, Unknown=47, NotChecked=202, Total=2862 [2025-02-08 08:02:56,514 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 493 mSDsluCounter, 3677 mSDsCounter, 0 mSdLazyCounter, 4981 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 4008 SdHoareTripleChecker+Invalid, 5013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 4981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:56,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 4008 Invalid, 5013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 4981 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-08 08:02:56,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-08 08:02:56,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 632. [2025-02-08 08:02:56,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 436 states have (on average 1.6077981651376148) internal successors, (701), 625 states have internal predecessors, (701), 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 08:02:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 717 transitions. [2025-02-08 08:02:56,526 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 717 transitions. Word has length 98 [2025-02-08 08:02:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:56,526 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 717 transitions. [2025-02-08 08:02:56,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 5.482758620689655) internal successors, (159), 30 states have internal predecessors, (159), 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 08:02:56,527 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 717 transitions. [2025-02-08 08:02:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 08:02:56,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:56,527 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, 1, 1] [2025-02-08 08:02:56,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 08:02:56,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:02:56,728 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 08:02:56,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1392605243, now seen corresponding path program 1 times [2025-02-08 08:02:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94432946] [2025-02-08 08:02:56,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:56,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:56,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 08:02:56,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 08:02:56,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:56,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:57,157 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 08:02:57,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:57,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94432946] [2025-02-08 08:02:57,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94432946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:57,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:57,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 08:02:57,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889137630] [2025-02-08 08:02:57,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:57,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 08:02:57,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:57,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 08:02:57,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:02:57,159 INFO L87 Difference]: Start difference. First operand 632 states and 717 transitions. Second operand has 15 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 1 states have call successors, (1), 1 states 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 08:02:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:02:58,895 INFO L93 Difference]: Finished difference Result 658 states and 746 transitions. [2025-02-08 08:02:58,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:02:58,895 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 1 states have call successors, (1), 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 100 [2025-02-08 08:02:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:02:58,897 INFO L225 Difference]: With dead ends: 658 [2025-02-08 08:02:58,897 INFO L226 Difference]: Without dead ends: 658 [2025-02-08 08:02:58,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-02-08 08:02:58,899 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 524 mSDsluCounter, 3110 mSDsCounter, 0 mSdLazyCounter, 3044 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 3444 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:02:58,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 3444 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 3044 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 08:02:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-02-08 08:02:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 654. [2025-02-08 08:02:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 457 states have (on average 1.5842450765864333) internal successors, (724), 646 states have internal predecessors, (724), 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 08:02:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 741 transitions. [2025-02-08 08:02:58,919 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 741 transitions. Word has length 100 [2025-02-08 08:02:58,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:02:58,920 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 741 transitions. [2025-02-08 08:02:58,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.0) internal successors, (98), 15 states have internal predecessors, (98), 1 states have call successors, (1), 1 states 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 08:02:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 741 transitions. [2025-02-08 08:02:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-08 08:02:58,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:02:58,920 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, 1, 1] [2025-02-08 08:02:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-08 08:02:58,920 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr202REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 08:02:58,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:02:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1392605242, now seen corresponding path program 1 times [2025-02-08 08:02:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:02:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499939848] [2025-02-08 08:02:58,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:02:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:02:58,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 08:02:58,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 08:02:58,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:02:58,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:02:59,933 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 08:02:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:02:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499939848] [2025-02-08 08:02:59,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499939848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:02:59,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:02:59,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-02-08 08:02:59,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598409792] [2025-02-08 08:02:59,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:02:59,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 08:02:59,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:02:59,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 08:02:59,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-02-08 08:02:59,935 INFO L87 Difference]: Start difference. First operand 654 states and 741 transitions. Second operand has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 1 states have call successors, (1), 1 states 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 08:03:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:03:01,815 INFO L93 Difference]: Finished difference Result 657 states and 745 transitions. [2025-02-08 08:03:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 08:03:01,816 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 1 states have call successors, (1), 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 100 [2025-02-08 08:03:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:03:01,817 INFO L225 Difference]: With dead ends: 657 [2025-02-08 08:03:01,817 INFO L226 Difference]: Without dead ends: 657 [2025-02-08 08:03:01,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2025-02-08 08:03:01,819 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 503 mSDsluCounter, 2202 mSDsCounter, 0 mSdLazyCounter, 2909 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:03:01,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 2534 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2909 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 08:03:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-02-08 08:03:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 654. [2025-02-08 08:03:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 457 states have (on average 1.5820568927789935) internal successors, (723), 646 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 08:03:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 740 transitions. [2025-02-08 08:03:01,827 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 740 transitions. Word has length 100 [2025-02-08 08:03:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:03:01,827 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 740 transitions. [2025-02-08 08:03:01,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.764705882352941) internal successors, (98), 18 states have internal predecessors, (98), 1 states have call successors, (1), 1 states 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 08:03:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 740 transitions. [2025-02-08 08:03:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 08:03:01,828 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:03:01,828 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, 1, 1, 1] [2025-02-08 08:03:01,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-08 08:03:01,831 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr201REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 08:03:01,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:03:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1241800251, now seen corresponding path program 1 times [2025-02-08 08:03:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:03:01,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521264978] [2025-02-08 08:03:01,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:03:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:03:01,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 08:03:01,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 08:03:01,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:03:01,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:03:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:03:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:03:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521264978] [2025-02-08 08:03:02,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521264978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:03:02,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:03:02,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 08:03:02,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545182259] [2025-02-08 08:03:02,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:03:02,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 08:03:02,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:03:02,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 08:03:02,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 08:03:02,068 INFO L87 Difference]: Start difference. First operand 654 states and 740 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 1 states have call successors, (1), 1 states 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 08:03:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:03:02,580 INFO L93 Difference]: Finished difference Result 653 states and 739 transitions. [2025-02-08 08:03:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 08:03:02,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 1 states have call successors, (1), 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 101 [2025-02-08 08:03:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:03:02,582 INFO L225 Difference]: With dead ends: 653 [2025-02-08 08:03:02,582 INFO L226 Difference]: Without dead ends: 653 [2025-02-08 08:03:02,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-08 08:03:02,582 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 2 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 08:03:02,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1693 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 08:03:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2025-02-08 08:03:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2025-02-08 08:03:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 457 states have (on average 1.5798687089715535) 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 08:03:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 739 transitions. [2025-02-08 08:03:02,589 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 739 transitions. Word has length 101 [2025-02-08 08:03:02,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:03:02,589 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 739 transitions. [2025-02-08 08:03:02,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 6 states have internal predecessors, (99), 1 states have call successors, (1), 1 states 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 08:03:02,589 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 739 transitions. [2025-02-08 08:03:02,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-02-08 08:03:02,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:03:02,590 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, 1, 1, 1] [2025-02-08 08:03:02,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-08 08:03:02,590 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr202REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 08:03:02,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:03:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1241800250, now seen corresponding path program 1 times [2025-02-08 08:03:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:03:02,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014053893] [2025-02-08 08:03:02,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:03:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:03:02,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 08:03:02,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 08:03:02,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:03:02,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:03:03,521 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 08:03:03,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:03:03,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014053893] [2025-02-08 08:03:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014053893] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:03:03,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957815467] [2025-02-08 08:03:03,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:03:03,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:03:03,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:03:03,526 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:03:03,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 08:03:03,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-08 08:03:03,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-08 08:03:03,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:03:03,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:03:03,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 08:03:03,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:03:03,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 6 treesize of output 5 [2025-02-08 08:03:03,921 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 08:03:03,928 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:03:03,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 08:03:03,960 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 08:03:03,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 08:03:04,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-08 08:03:04,043 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 08:03:04,161 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:03:04,162 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 08:03:04,169 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 08:03:04,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:03:04,284 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 08:03:04,289 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 08:03:04,377 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:03:04,377 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 08:03:04,382 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 08:03:04,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:03:04,471 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 08:03:04,485 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 08:03:04,590 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:03:04,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 73 treesize of output 66 [2025-02-08 08:03:04,598 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 08:03:04,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 08:03:04,693 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-08 08:03:04,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2025-02-08 08:03:04,707 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-02-08 08:03:04,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-02-08 08:03:04,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 08:03:04,777 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 88 treesize of output 79 [2025-02-08 08:03:04,784 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 52 treesize of output 16 [2025-02-08 08:03:04,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2025-02-08 08:03:04,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2025-02-08 08:03:04,909 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 08:03:04,909 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 08:03:05,714 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2868 (Array Int Int)) (v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_11| Int) (v_ArrVal_2870 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2871 Int) (v_ArrVal_2873 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_2867))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_2866) .cse5 v_ArrVal_2869))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (< v_ArrVal_2871 0) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2868))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_11| v_ArrVal_2871)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2870) (select (select (store .cse3 .cse1 v_ArrVal_2873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_11|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_11| 0)))))))) is different from false [2025-02-08 08:03:05,772 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2868 (Array Int Int)) (v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_11| Int) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 Int) (v_ArrVal_2864 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2871 Int) (v_ArrVal_2873 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2865)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse7 .cse6 v_ArrVal_2867))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2864) .cse6 v_ArrVal_2866) .cse5 v_ArrVal_2869))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2868))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_11| v_ArrVal_2871)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2870) (select (select (store .cse3 .cse1 v_ArrVal_2873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< v_ArrVal_2871 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_11|) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_11| 0)))))))) is different from false [2025-02-08 08:03:05,805 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2868 (Array Int Int)) (v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_11| Int) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2870 Int) (v_ArrVal_2864 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2871 Int) (v_ArrVal_2873 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_2865))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_2867))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_2864) .cse7 v_ArrVal_2866) .cse5 v_ArrVal_2869))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2868))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_11| v_ArrVal_2871)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2870) (select (select (store .cse3 .cse1 v_ArrVal_2873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< v_ArrVal_2871 0) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_11| 0) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_11|)))))))))) is different from false [2025-02-08 08:03:05,866 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2869 (Array Int Int)) (v_ArrVal_2868 (Array Int Int)) (v_ArrVal_2867 (Array Int Int)) (v_ArrVal_2866 (Array Int Int)) (v_ArrVal_2865 (Array Int Int)) (v_ArrVal_2864 (Array Int Int)) (v_ArrVal_2863 (Array Int Int)) (v_ArrVal_2862 (Array Int Int)) (v_ArrVal_2873 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_11| Int) (v_ArrVal_2870 Int) (|v_ULTIMATE.start_main_#t~malloc57#1.base_9| Int) (v_ArrVal_2871 Int)) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2862)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2865))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse4 (store .cse8 .cse7 v_ArrVal_2867))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_2863) .cse6 v_ArrVal_2864) .cse7 v_ArrVal_2866) .cse5 v_ArrVal_2869))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_9|) 0)) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_2868))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (< (+ (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_main_#t~mem56#1.offset_11| v_ArrVal_2871)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 43) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_9| v_ArrVal_2870) (select (select (store .cse3 .cse1 v_ArrVal_2873) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) (< (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) |v_ULTIMATE.start_main_#t~mem56#1.offset_11|) (< v_ArrVal_2871 0) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_11| 0)))))))))) is different from false [2025-02-08 08:03:06,516 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-08 08:03:06,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-02-08 08:03:10,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957815467] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:03:10,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 08:03:10,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2025-02-08 08:03:10,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711178165] [2025-02-08 08:03:10,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 08:03:10,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 08:03:10,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:03:10,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 08:03:10,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1722, Unknown=52, NotChecked=356, Total=2352 [2025-02-08 08:03:10,325 INFO L87 Difference]: Start difference. First operand 653 states and 739 transitions. Second operand has 35 states, 32 states have (on average 5.15625) internal successors, (165), 33 states have internal predecessors, (165), 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 08:03:13,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:03:13,296 INFO L93 Difference]: Finished difference Result 655 states and 743 transitions. [2025-02-08 08:03:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 08:03:13,297 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 5.15625) internal successors, (165), 33 states have internal predecessors, (165), 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 101 [2025-02-08 08:03:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:03:13,299 INFO L225 Difference]: With dead ends: 655 [2025-02-08 08:03:13,299 INFO L226 Difference]: Without dead ends: 655 [2025-02-08 08:03:13,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=416, Invalid=2853, Unknown=53, NotChecked=460, Total=3782 [2025-02-08 08:03:13,300 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 493 mSDsluCounter, 2940 mSDsCounter, 0 mSdLazyCounter, 4000 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 3270 SdHoareTripleChecker+Invalid, 4031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:03:13,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 3270 Invalid, 4031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4000 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 08:03:13,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-02-08 08:03:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 630. [2025-02-08 08:03:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 436 states have (on average 1.603211009174312) internal successors, (699), 623 states have internal predecessors, (699), 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 08:03:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 715 transitions. [2025-02-08 08:03:13,304 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 715 transitions. Word has length 101 [2025-02-08 08:03:13,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:03:13,304 INFO L471 AbstractCegarLoop]: Abstraction has 630 states and 715 transitions. [2025-02-08 08:03:13,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 5.15625) internal successors, (165), 33 states have internal predecessors, (165), 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 08:03:13,304 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 715 transitions. [2025-02-08 08:03:13,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 08:03:13,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:03:13,305 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, 1, 1, 1, 1, 1] [2025-02-08 08:03:13,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 08:03:13,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-08 08:03:13,505 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr197REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 08:03:13,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:03:13,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2013220503, now seen corresponding path program 1 times [2025-02-08 08:03:13,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:03:13,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84622596] [2025-02-08 08:03:13,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:03:13,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:03:13,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 08:03:13,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 08:03:13,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:03:13,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:03:14,035 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 08:03:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:03:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84622596] [2025-02-08 08:03:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84622596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:03:14,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:03:14,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-08 08:03:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812296292] [2025-02-08 08:03:14,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:03:14,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 08:03:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:03:14,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 08:03:14,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-02-08 08:03:14,036 INFO L87 Difference]: Start difference. First operand 630 states and 715 transitions. Second operand has 17 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:03:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:03:15,758 INFO L93 Difference]: Finished difference Result 681 states and 771 transitions. [2025-02-08 08:03:15,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:03:15,758 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2025-02-08 08:03:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:03:15,760 INFO L225 Difference]: With dead ends: 681 [2025-02-08 08:03:15,760 INFO L226 Difference]: Without dead ends: 681 [2025-02-08 08:03:15,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-02-08 08:03:15,760 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 577 mSDsluCounter, 3491 mSDsCounter, 0 mSdLazyCounter, 3450 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 3831 SdHoareTripleChecker+Invalid, 3477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-08 08:03:15,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 3831 Invalid, 3477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3450 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-08 08:03:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-02-08 08:03:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 655. [2025-02-08 08:03:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 460 states have (on average 1.576086956521739) internal successors, (725), 647 states have internal predecessors, (725), 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 08:03:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 742 transitions. [2025-02-08 08:03:15,769 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 742 transitions. Word has length 103 [2025-02-08 08:03:15,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:03:15,769 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 742 transitions. [2025-02-08 08:03:15,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.3125) internal successors, (101), 17 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:03:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 742 transitions. [2025-02-08 08:03:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-08 08:03:15,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:03:15,769 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, 1, 1, 1, 1, 1] [2025-02-08 08:03:15,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-08 08:03:15,769 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr198REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 08:03:15,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:03:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash -2013220502, now seen corresponding path program 1 times [2025-02-08 08:03:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:03:15,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474637029] [2025-02-08 08:03:15,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:03:15,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:03:15,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-08 08:03:15,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-08 08:03:15,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:03:15,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:03:16,545 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 08:03:16,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:03:16,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474637029] [2025-02-08 08:03:16,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474637029] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:03:16,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:03:16,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 08:03:16,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376846990] [2025-02-08 08:03:16,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:03:16,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 08:03:16,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:03:16,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 08:03:16,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-02-08 08:03:16,548 INFO L87 Difference]: Start difference. First operand 655 states and 742 transitions. Second operand has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:03:18,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:03:18,984 INFO L93 Difference]: Finished difference Result 680 states and 770 transitions. [2025-02-08 08:03:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 08:03:18,985 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 103 [2025-02-08 08:03:18,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:03:18,987 INFO L225 Difference]: With dead ends: 680 [2025-02-08 08:03:18,988 INFO L226 Difference]: Without dead ends: 680 [2025-02-08 08:03:18,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2025-02-08 08:03:18,988 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 585 mSDsluCounter, 3570 mSDsCounter, 0 mSdLazyCounter, 3752 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 3898 SdHoareTripleChecker+Invalid, 3780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 08:03:18,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 3898 Invalid, 3780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3752 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 08:03:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-02-08 08:03:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 655. [2025-02-08 08:03:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 460 states have (on average 1.5739130434782609) internal successors, (724), 647 states have internal predecessors, (724), 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 08:03:18,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 741 transitions. [2025-02-08 08:03:18,994 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 741 transitions. Word has length 103 [2025-02-08 08:03:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:03:18,994 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 741 transitions. [2025-02-08 08:03:18,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 16 states have internal predecessors, (101), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 08:03:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 741 transitions. [2025-02-08 08:03:18,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 08:03:18,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:03:18,995 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, 1, 1, 1, 1, 1, 1] [2025-02-08 08:03:18,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-08 08:03:18,995 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr197REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 08:03:18,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:03:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1917495447, now seen corresponding path program 1 times [2025-02-08 08:03:18,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:03:18,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127446988] [2025-02-08 08:03:18,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:03:18,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:03:19,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 08:03:19,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 08:03:19,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:03:19,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:03:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:03:20,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:03:20,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127446988] [2025-02-08 08:03:20,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127446988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:03:20,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 08:03:20,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 08:03:20,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306109066] [2025-02-08 08:03:20,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:03:20,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 08:03:20,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:03:20,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 08:03:20,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-02-08 08:03:20,510 INFO L87 Difference]: Start difference. First operand 655 states and 741 transitions. Second operand has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states 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 08:03:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:03:22,476 INFO L93 Difference]: Finished difference Result 654 states and 740 transitions. [2025-02-08 08:03:22,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 08:03:22,476 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2025-02-08 08:03:22,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 08:03:22,478 INFO L225 Difference]: With dead ends: 654 [2025-02-08 08:03:22,480 INFO L226 Difference]: Without dead ends: 654 [2025-02-08 08:03:22,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2025-02-08 08:03:22,481 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 521 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 3320 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-08 08:03:22,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 3320 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2797 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-08 08:03:22,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-02-08 08:03:22,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2025-02-08 08:03:22,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 460 states have (on average 1.5717391304347825) internal successors, (723), 646 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 08:03:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 740 transitions. [2025-02-08 08:03:22,486 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 740 transitions. Word has length 104 [2025-02-08 08:03:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 08:03:22,486 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 740 transitions. [2025-02-08 08:03:22,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states 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 08:03:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 740 transitions. [2025-02-08 08:03:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-02-08 08:03:22,487 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 08:03:22,487 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, 1, 1, 1, 1, 1, 1] [2025-02-08 08:03:22,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-08 08:03:22,487 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr198REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 317 more)] === [2025-02-08 08:03:22,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 08:03:22,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1917495446, now seen corresponding path program 1 times [2025-02-08 08:03:22,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 08:03:22,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976120790] [2025-02-08 08:03:22,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:03:22,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 08:03:22,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 08:03:22,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 08:03:22,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:03:22,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:03:23,262 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 08:03:23,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 08:03:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976120790] [2025-02-08 08:03:23,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976120790] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 08:03:23,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94255736] [2025-02-08 08:03:23,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 08:03:23,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 08:03:23,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 08:03:23,264 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 08:03:23,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 08:03:23,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-08 08:03:23,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-08 08:03:23,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 08:03:23,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 08:03:23,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 08:03:23,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 08:03:23,751 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 08:03:23,751 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 08:03:23,811 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-08 08:03:23,811 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 1 case distinctions, treesize of input 25 treesize of output 23 [2025-02-08 08:03:23,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 08:03:24,075 INFO L349 Elim1Store]: treesize reduction 74, result has 26.7 percent of original size [2025-02-08 08:03:24,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 115 [2025-02-08 08:03:24,116 INFO L349 Elim1Store]: treesize reduction 104, result has 24.1 percent of original size [2025-02-08 08:03:24,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 70 [2025-02-08 08:03:24,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:03:24,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 83 treesize of output 75 [2025-02-08 08:03:24,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 08:03:24,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 67 treesize of output 53 [2025-02-08 08:03:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 08:03:24,384 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 08:03:24,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94255736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 08:03:24,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 08:03:24,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 26 [2025-02-08 08:03:24,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068846878] [2025-02-08 08:03:24,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 08:03:24,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 08:03:24,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 08:03:24,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 08:03:24,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2025-02-08 08:03:24,386 INFO L87 Difference]: Start difference. First operand 654 states and 740 transitions. Second operand has 11 states, 10 states have (on average 10.2) internal successors, (102), 11 states have internal predecessors, (102), 1 states have call successors, (1), 1 states 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 08:03:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 08:03:25,892 INFO L93 Difference]: Finished difference Result 653 states and 739 transitions. [2025-02-08 08:03:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 08:03:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 10.2) internal successors, (102), 11 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104