./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 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/list-simple/dll2n_insert_unequal.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 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:41:08,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:41:08,904 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:41:08,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:41:08,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:41:08,933 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:41:08,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:41:08,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:41:08,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:41:08,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:41:08,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:41:08,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:41:08,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:41:08,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:41:08,934 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:41:08,935 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:41:08,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:41:08,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:41:08,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:41:08,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:41:08,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:41:08,936 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:41:08,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:41:08,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:41:08,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:41:08,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:41:08,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:41:08,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:41:08,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:41:08,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:41:08,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:41:08,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:41:08,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:41:08,937 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:41:08,937 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 -> 97351642d4f3bf3f6d868e0a3719427b4c33bd5e0f87a93a325784728b912f03 [2025-01-09 22:41:09,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:41:09,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:41:09,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:41:09,168 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:41:09,168 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:41:09,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2025-01-09 22:41:10,278 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b6089d9c/9ea6eaeba87244c7a67812b83ec4165b/FLAG20c615332 [2025-01-09 22:41:10,548 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:41:10,549 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_insert_unequal.i [2025-01-09 22:41:10,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b6089d9c/9ea6eaeba87244c7a67812b83ec4165b/FLAG20c615332 [2025-01-09 22:41:10,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b6089d9c/9ea6eaeba87244c7a67812b83ec4165b [2025-01-09 22:41:10,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:41:10,846 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:41:10,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:41:10,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:41:10,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:41:10,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:41:10" (1/1) ... [2025-01-09 22:41:10,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50e60115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:10, skipping insertion in model container [2025-01-09 22:41:10,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:41:10" (1/1) ... [2025-01-09 22:41:10,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:41:11,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:41:11,099 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:41:11,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:41:11,159 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:41:11,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11 WrapperNode [2025-01-09 22:41:11,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:41:11,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:41:11,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:41:11,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:41:11,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,198 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 158 [2025-01-09 22:41:11,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:41:11,199 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:41:11,199 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:41:11,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:41:11,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,208 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,228 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 21, 8]. 68 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2025-01-09 22:41:11,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,245 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,246 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,252 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:41:11,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:41:11,253 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:41:11,253 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:41:11,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (1/1) ... [2025-01-09 22:41:11,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:41:11,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:11,283 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-01-09 22:41:11,288 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-01-09 22:41:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-01-09 22:41:11,301 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-01-09 22:41:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:41:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:41:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 22:41:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:41:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:41:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:41:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:41:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:41:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:41:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:41:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:41:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:41:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:41:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:41:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:41:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:41:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:41:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:41:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:41:11,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:41:11,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:41:11,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:41:11,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:41:11,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:41:11,405 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:41:11,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:41:11,419 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-01-09 22:41:11,736 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-01-09 22:41:11,736 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:41:11,744 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:41:11,744 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:41:11,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:41:11 BoogieIcfgContainer [2025-01-09 22:41:11,744 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:41:11,746 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:41:11,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:41:11,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:41:11,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:41:10" (1/3) ... [2025-01-09 22:41:11,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cea42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:41:11, skipping insertion in model container [2025-01-09 22:41:11,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:41:11" (2/3) ... [2025-01-09 22:41:11,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cea42d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:41:11, skipping insertion in model container [2025-01-09 22:41:11,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:41:11" (3/3) ... [2025-01-09 22:41:11,751 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_insert_unequal.i [2025-01-09 22:41:11,760 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:41:11,761 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_insert_unequal.i that has 2 procedures, 137 locations, 1 initial locations, 5 loop locations, and 61 error locations. [2025-01-09 22:41:11,785 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:41:11,793 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;@638ebc3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:41:11,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-01-09 22:41:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 134 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:41:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:41:11,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:11,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:41:11,801 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:11,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:11,804 INFO L85 PathProgramCache]: Analyzing trace with hash 33466411, now seen corresponding path program 1 times [2025-01-09 22:41:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:11,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720837105] [2025-01-09 22:41:11,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:11,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:41:11,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:41:11,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:11,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:11,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720837105] [2025-01-09 22:41:11,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720837105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:11,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:11,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:41:11,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695460466] [2025-01-09 22:41:11,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:11,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:41:11,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:11,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:41:11,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:41:11,961 INFO L87 Difference]: Start difference. First operand has 136 states, 72 states have (on average 2.0694444444444446) internal successors, (149), 134 states have internal predecessors, (149), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:41:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:12,057 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2025-01-09 22:41:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:41:12,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:41:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:12,063 INFO L225 Difference]: With dead ends: 132 [2025-01-09 22:41:12,064 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 22:41:12,065 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-01-09 22:41:12,067 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 9 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:12,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 207 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 22:41:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-09 22:41:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 68 states have (on average 2.014705882352941) internal successors, (137), 125 states have internal predecessors, (137), 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-01-09 22:41:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2025-01-09 22:41:12,091 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 5 [2025-01-09 22:41:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:12,091 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2025-01-09 22:41:12,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:41:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2025-01-09 22:41:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:41:12,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:12,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:41:12,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:41:12,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:12,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:12,093 INFO L85 PathProgramCache]: Analyzing trace with hash 33466412, now seen corresponding path program 1 times [2025-01-09 22:41:12,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:12,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598926923] [2025-01-09 22:41:12,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:12,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:12,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:41:12,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:41:12,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:12,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:12,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:12,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598926923] [2025-01-09 22:41:12,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598926923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:12,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:12,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:41:12,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247782786] [2025-01-09 22:41:12,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:12,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:41:12,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:12,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:41:12,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:41:12,178 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:41:12,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:12,251 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2025-01-09 22:41:12,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:41:12,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:41:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:12,253 INFO L225 Difference]: With dead ends: 123 [2025-01-09 22:41:12,253 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 22:41:12,253 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-01-09 22:41:12,254 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 8 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:12,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 199 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 22:41:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 22:41:12,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.9705882352941178) internal successors, (134), 122 states have internal predecessors, (134), 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-01-09 22:41:12,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2025-01-09 22:41:12,266 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 5 [2025-01-09 22:41:12,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:12,267 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2025-01-09 22:41:12,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:41:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2025-01-09 22:41:12,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-09 22:41:12,267 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:12,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-09 22:41:12,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:41:12,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:12,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1038316840, now seen corresponding path program 1 times [2025-01-09 22:41:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:12,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592875151] [2025-01-09 22:41:12,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:12,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:12,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-09 22:41:12,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-09 22:41:12,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:12,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592875151] [2025-01-09 22:41:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592875151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:12,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:12,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:41:12,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427074461] [2025-01-09 22:41:12,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:12,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:41:12,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:12,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:41:12,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:41:12,364 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:41:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:12,376 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2025-01-09 22:41:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:41:12,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-09 22:41:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:12,378 INFO L225 Difference]: With dead ends: 133 [2025-01-09 22:41:12,379 INFO L226 Difference]: Without dead ends: 133 [2025-01-09 22:41:12,379 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-01-09 22:41:12,380 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 10 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:12,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 261 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-01-09 22:41:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2025-01-09 22:41:12,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 69 states have (on average 1.9565217391304348) internal successors, (135), 123 states have internal predecessors, (135), 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-01-09 22:41:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2025-01-09 22:41:12,384 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 6 [2025-01-09 22:41:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:12,385 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2025-01-09 22:41:12,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:41:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2025-01-09 22:41:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:41:12,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:12,386 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:12,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:41:12,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:12,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:12,387 INFO L85 PathProgramCache]: Analyzing trace with hash 348447983, now seen corresponding path program 1 times [2025-01-09 22:41:12,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:12,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356978104] [2025-01-09 22:41:12,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:12,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:12,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:41:12,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:41:12,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:12,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:12,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:12,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356978104] [2025-01-09 22:41:12,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356978104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:12,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:12,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:41:12,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59382988] [2025-01-09 22:41:12,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:12,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:41:12,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:12,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:41:12,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:41:12,440 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-01-09 22:41:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:12,457 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2025-01-09 22:41:12,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:41:12,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:41:12,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:12,458 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:41:12,459 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:41:12,460 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-01-09 22:41:12,460 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:12,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 256 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:41:12,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-01-09 22:41:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 74 states have (on average 1.8918918918918919) internal successors, (140), 128 states have internal predecessors, (140), 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-01-09 22:41:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2025-01-09 22:41:12,469 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 9 [2025-01-09 22:41:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:12,469 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2025-01-09 22:41:12,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-01-09 22:41:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2025-01-09 22:41:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 22:41:12,470 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:12,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:12,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:41:12,470 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:12,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:12,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1245978540, now seen corresponding path program 1 times [2025-01-09 22:41:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:12,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694684274] [2025-01-09 22:41:12,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:12,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:41:12,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:41:12,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:12,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:12,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694684274] [2025-01-09 22:41:12,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694684274] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:12,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779800013] [2025-01-09 22:41:12,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:12,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:12,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:12,584 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-01-09 22:41:12,586 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-01-09 22:41:12,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 22:41:12,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 22:41:12,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:12,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:12,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:41:12,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:12,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:12,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779800013] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:12,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:12,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 22:41:12,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195460591] [2025-01-09 22:41:12,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:12,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:41:12,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:12,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:41:12,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:41:12,739 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-01-09 22:41:12,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:12,758 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2025-01-09 22:41:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:41:12,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 13 [2025-01-09 22:41:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:12,759 INFO L225 Difference]: With dead ends: 131 [2025-01-09 22:41:12,759 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 22:41:12,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:41:12,759 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 10 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:12,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 270 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 22:41:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-01-09 22:41:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 76 states have (on average 1.868421052631579) internal successors, (142), 130 states have internal predecessors, (142), 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-01-09 22:41:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2025-01-09 22:41:12,768 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 13 [2025-01-09 22:41:12,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:12,768 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2025-01-09 22:41:12,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-01-09 22:41:12,768 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2025-01-09 22:41:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:41:12,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:12,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:12,775 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-01-09 22:41:12,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:12,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:12,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1633379773, now seen corresponding path program 1 times [2025-01-09 22:41:12,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:12,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690029701] [2025-01-09 22:41:12,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:12,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:12,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:41:12,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:41:13,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:13,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:13,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:13,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690029701] [2025-01-09 22:41:13,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690029701] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:13,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898656396] [2025-01-09 22:41:13,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:13,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:13,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:13,199 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-01-09 22:41:13,204 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-01-09 22:41:13,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:41:13,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:41:13,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:13,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:13,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 22:41:13,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:13,311 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-01-09 22:41:13,342 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:41:13,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:41:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:13,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:13,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898656396] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:13,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:13,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2025-01-09 22:41:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183335555] [2025-01-09 22:41:13,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:13,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:41:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:13,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:41:13,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:41:13,387 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-01-09 22:41:13,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:13,553 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2025-01-09 22:41:13,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:13,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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 16 [2025-01-09 22:41:13,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:13,556 INFO L225 Difference]: With dead ends: 130 [2025-01-09 22:41:13,556 INFO L226 Difference]: Without dead ends: 130 [2025-01-09 22:41:13,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:41:13,557 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 3 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:13,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 325 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:41:13,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-09 22:41:13,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-01-09 22:41:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 76 states have (on average 1.855263157894737) internal successors, (141), 129 states have internal predecessors, (141), 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-01-09 22:41:13,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-01-09 22:41:13,561 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 16 [2025-01-09 22:41:13,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:13,561 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-01-09 22:41:13,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 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-01-09 22:41:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-01-09 22:41:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 22:41:13,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:13,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:13,571 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-01-09 22:41:13,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:13,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:13,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1633379772, now seen corresponding path program 1 times [2025-01-09 22:41:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:13,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311377355] [2025-01-09 22:41:13,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:13,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:13,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:41:13,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:41:13,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:13,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:13,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:13,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311377355] [2025-01-09 22:41:13,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311377355] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:13,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117748203] [2025-01-09 22:41:13,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:13,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:13,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:13,902 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-01-09 22:41:13,903 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-01-09 22:41:13,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 22:41:13,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 22:41:13,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:13,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:13,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 22:41:13,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:13,986 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-01-09 22:41:14,046 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:41:14,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:41:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:14,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:14,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:14,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117748203] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:14,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:14,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 10 [2025-01-09 22:41:14,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317828333] [2025-01-09 22:41:14,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:14,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:41:14,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:14,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:41:14,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:41:14,215 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 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-01-09 22:41:14,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:14,355 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2025-01-09 22:41:14,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:14,356 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 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 16 [2025-01-09 22:41:14,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:14,356 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:41:14,356 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:41:14,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:41:14,357 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 12 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:14,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 457 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:41:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-01-09 22:41:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 128 states have internal predecessors, (140), 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-01-09 22:41:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2025-01-09 22:41:14,361 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 16 [2025-01-09 22:41:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:14,361 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2025-01-09 22:41:14,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 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-01-09 22:41:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2025-01-09 22:41:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:41:14,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:14,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:14,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:14,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:14,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:14,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:14,563 INFO L85 PathProgramCache]: Analyzing trace with hash 861457320, now seen corresponding path program 2 times [2025-01-09 22:41:14,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:14,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400800414] [2025-01-09 22:41:14,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:41:14,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:14,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 22:41:14,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 20 statements. [2025-01-09 22:41:14,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:41:14,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:14,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400800414] [2025-01-09 22:41:14,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400800414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:14,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:14,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:41:14,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486969275] [2025-01-09 22:41:14,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:14,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:41:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:14,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:41:14,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:41:14,596 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 22:41:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:14,652 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2025-01-09 22:41:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:41:14,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 20 [2025-01-09 22:41:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:14,653 INFO L225 Difference]: With dead ends: 126 [2025-01-09 22:41:14,653 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 22:41:14,653 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-01-09 22:41:14,654 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:14,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 187 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:14,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 22:41:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-09 22:41:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 125 states have internal predecessors, (137), 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-01-09 22:41:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 137 transitions. [2025-01-09 22:41:14,657 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 137 transitions. Word has length 20 [2025-01-09 22:41:14,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:14,657 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 137 transitions. [2025-01-09 22:41:14,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-01-09 22:41:14,657 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 137 transitions. [2025-01-09 22:41:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:41:14,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:14,658 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:14,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:41:14,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:14,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:14,658 INFO L85 PathProgramCache]: Analyzing trace with hash 861457321, now seen corresponding path program 1 times [2025-01-09 22:41:14,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:14,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178552883] [2025-01-09 22:41:14,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:14,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:14,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:41:14,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:41:14,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:14,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:14,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178552883] [2025-01-09 22:41:14,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178552883] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:14,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104840224] [2025-01-09 22:41:14,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:14,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:14,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:14,704 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-01-09 22:41:14,704 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-01-09 22:41:14,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:41:14,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:41:14,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:14,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:14,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:41:14,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:14,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:14,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:14,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104840224] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:14,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:14,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-09 22:41:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133201089] [2025-01-09 22:41:14,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:14,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:41:14,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:14,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:41:14,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:41:14,861 INFO L87 Difference]: Start difference. First operand 126 states and 137 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-01-09 22:41:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:14,886 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2025-01-09 22:41:14,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:14,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2025-01-09 22:41:14,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:14,888 INFO L225 Difference]: With dead ends: 126 [2025-01-09 22:41:14,888 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 22:41:14,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-01-09 22:41:14,889 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 3 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:14,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 357 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 22:41:14,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-09 22:41:14,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.7894736842105263) internal successors, (136), 125 states have internal predecessors, (136), 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-01-09 22:41:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2025-01-09 22:41:14,891 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 20 [2025-01-09 22:41:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:14,891 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2025-01-09 22:41:14,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-01-09 22:41:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2025-01-09 22:41:14,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:41:14,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:14,892 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:14,901 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-01-09 22:41:15,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 22:41:15,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:15,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:15,093 INFO L85 PathProgramCache]: Analyzing trace with hash 619134697, now seen corresponding path program 1 times [2025-01-09 22:41:15,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:15,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721233809] [2025-01-09 22:41:15,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:15,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:15,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:41:15,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:41:15,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:15,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:15,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:15,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:15,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721233809] [2025-01-09 22:41:15,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721233809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:15,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:15,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:41:15,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784516868] [2025-01-09 22:41:15,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:15,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:41:15,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:15,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:41:15,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:41:15,160 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-01-09 22:41:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:15,219 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2025-01-09 22:41:15,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:41:15,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 21 [2025-01-09 22:41:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:15,220 INFO L225 Difference]: With dead ends: 123 [2025-01-09 22:41:15,220 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 22:41:15,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:41:15,221 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:15,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 191 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:15,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 22:41:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 22:41:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 76 states have (on average 1.75) internal successors, (133), 122 states have internal predecessors, (133), 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-01-09 22:41:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2025-01-09 22:41:15,223 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 21 [2025-01-09 22:41:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:15,223 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2025-01-09 22:41:15,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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-01-09 22:41:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2025-01-09 22:41:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:41:15,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:15,224 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:15,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:41:15,224 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:15,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash 756392274, now seen corresponding path program 1 times [2025-01-09 22:41:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:15,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043094610] [2025-01-09 22:41:15,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:15,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:15,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:41:15,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:41:15,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:15,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:15,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043094610] [2025-01-09 22:41:15,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043094610] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:15,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315349263] [2025-01-09 22:41:15,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:15,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:15,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:15,437 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-01-09 22:41:15,438 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-01-09 22:41:15,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:41:15,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:41:15,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:15,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:15,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:41:15,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:15,564 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-01-09 22:41:15,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:15,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:41:15,591 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:41:15,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:41:15,619 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:41:15,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:41:15,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:41:15,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:41:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315349263] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:15,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 8 [2025-01-09 22:41:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680685684] [2025-01-09 22:41:15,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:15,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:41:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:15,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:41:15,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:41:15,710 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 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-01-09 22:41:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:15,874 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2025-01-09 22:41:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:15,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 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 26 [2025-01-09 22:41:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:15,875 INFO L225 Difference]: With dead ends: 129 [2025-01-09 22:41:15,875 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 22:41:15,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:41:15,876 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 181 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:15,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 228 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:41:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 22:41:15,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 116. [2025-01-09 22:41:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 76 states have (on average 1.6578947368421053) internal successors, (126), 115 states have internal predecessors, (126), 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-01-09 22:41:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 126 transitions. [2025-01-09 22:41:15,878 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 126 transitions. Word has length 26 [2025-01-09 22:41:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:15,879 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 126 transitions. [2025-01-09 22:41:15,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 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-01-09 22:41:15,879 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2025-01-09 22:41:15,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:41:15,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:15,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:15,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:16,085 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,SelfDestructingSolverStorable10 [2025-01-09 22:41:16,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:16,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash 756392275, now seen corresponding path program 1 times [2025-01-09 22:41:16,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:16,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980126737] [2025-01-09 22:41:16,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:16,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:16,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:41:16,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:41:16,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:16,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:41:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980126737] [2025-01-09 22:41:16,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980126737] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:16,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757030023] [2025-01-09 22:41:16,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:16,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:16,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:16,442 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-01-09 22:41:16,443 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-01-09 22:41:16,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:41:16,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:41:16,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:16,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:16,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 22:41:16,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:16,591 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-01-09 22:41:16,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:16,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:41:16,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:16,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:41:16,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:16,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:41:16,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:16,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:41:16,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757030023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:16,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:41:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2025-01-09 22:41:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796035483] [2025-01-09 22:41:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:16,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:41:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:16,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:41:16,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:41:16,702 INFO L87 Difference]: Start difference. First operand 116 states and 126 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-01-09 22:41:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:16,777 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2025-01-09 22:41:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:41:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 26 [2025-01-09 22:41:16,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:16,778 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:41:16,778 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:41:16,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:41:16,778 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 121 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:16,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 123 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:16,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:41:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 22:41:16,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.5657894736842106) internal successors, (119), 108 states have internal predecessors, (119), 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-01-09 22:41:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2025-01-09 22:41:16,781 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 26 [2025-01-09 22:41:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:16,781 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2025-01-09 22:41:16,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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-01-09 22:41:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2025-01-09 22:41:16,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:41:16,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:16,781 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:16,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:16,986 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,SelfDestructingSolverStorable11 [2025-01-09 22:41:16,986 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:16,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -2011133487, now seen corresponding path program 1 times [2025-01-09 22:41:16,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:16,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992041517] [2025-01-09 22:41:16,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:16,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:16,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:41:17,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:41:17,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:17,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:17,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:17,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992041517] [2025-01-09 22:41:17,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992041517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:17,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:17,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:41:17,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329304692] [2025-01-09 22:41:17,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:41:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:17,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:41:17,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:41:17,160 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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-01-09 22:41:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:17,390 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2025-01-09 22:41:17,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:41:17,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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 29 [2025-01-09 22:41:17,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:17,391 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:41:17,391 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:41:17,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:41:17,392 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 103 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:17,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 404 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:41:17,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:41:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2025-01-09 22:41:17,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.6428571428571428) internal successors, (138), 116 states have internal predecessors, (138), 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-01-09 22:41:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 138 transitions. [2025-01-09 22:41:17,394 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 138 transitions. Word has length 29 [2025-01-09 22:41:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:17,394 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 138 transitions. [2025-01-09 22:41:17,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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-01-09 22:41:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 138 transitions. [2025-01-09 22:41:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-09 22:41:17,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:17,395 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:17,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 22:41:17,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:17,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2011133486, now seen corresponding path program 1 times [2025-01-09 22:41:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:17,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229496159] [2025-01-09 22:41:17,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:17,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:17,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 22:41:17,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 22:41:17,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:17,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:17,646 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:17,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:17,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229496159] [2025-01-09 22:41:17,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229496159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:17,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:17,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:41:17,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743395959] [2025-01-09 22:41:17,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:17,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:41:17,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:17,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:41:17,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:41:17,647 INFO L87 Difference]: Start difference. First operand 117 states and 138 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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-01-09 22:41:17,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:17,912 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2025-01-09 22:41:17,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:41:17,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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 29 [2025-01-09 22:41:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:17,913 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:41:17,913 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:41:17,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:41:17,913 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 101 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:17,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 407 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:41:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:41:17,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 117. [2025-01-09 22:41:17,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.619047619047619) internal successors, (136), 116 states have internal predecessors, (136), 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-01-09 22:41:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2025-01-09 22:41:17,916 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 29 [2025-01-09 22:41:17,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:17,916 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2025-01-09 22:41:17,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 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-01-09 22:41:17,916 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2025-01-09 22:41:17,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:41:17,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:17,916 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:17,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 22:41:17,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:17,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:17,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2079377406, now seen corresponding path program 1 times [2025-01-09 22:41:17,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:17,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749184517] [2025-01-09 22:41:17,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:17,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:17,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:41:17,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:41:17,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:17,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:17,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749184517] [2025-01-09 22:41:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749184517] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:17,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:17,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:41:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686706922] [2025-01-09 22:41:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:17,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:41:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:17,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:41:17,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:41:17,958 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:41:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:17,967 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2025-01-09 22:41:17,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:41:17,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 22:41:17,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:17,968 INFO L225 Difference]: With dead ends: 112 [2025-01-09 22:41:17,968 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 22:41:17,968 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-01-09 22:41:17,968 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:17,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:17,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 22:41:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-01-09 22:41:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 111 states have internal predecessors, (123), 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-01-09 22:41:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2025-01-09 22:41:17,970 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 30 [2025-01-09 22:41:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:17,970 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2025-01-09 22:41:17,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:41:17,970 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2025-01-09 22:41:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:41:17,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:17,971 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:17,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:41:17,971 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:17,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:17,972 INFO L85 PathProgramCache]: Analyzing trace with hash 36210026, now seen corresponding path program 1 times [2025-01-09 22:41:17,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:17,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239746720] [2025-01-09 22:41:17,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:17,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:17,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:41:17,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:41:17,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:17,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:18,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:18,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239746720] [2025-01-09 22:41:18,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239746720] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:18,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:18,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:41:18,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94922833] [2025-01-09 22:41:18,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:18,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:41:18,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:18,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:41:18,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:41:18,028 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-01-09 22:41:18,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:18,117 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2025-01-09 22:41:18,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:18,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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 31 [2025-01-09 22:41:18,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:18,118 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:41:18,118 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:41:18,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:41:18,118 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 26 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:18,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 238 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:41:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 22:41:18,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.518987341772152) internal successors, (120), 108 states have internal predecessors, (120), 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-01-09 22:41:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2025-01-09 22:41:18,120 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 31 [2025-01-09 22:41:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:18,120 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2025-01-09 22:41:18,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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-01-09 22:41:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2025-01-09 22:41:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:41:18,121 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:18,121 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:18,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:41:18,121 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:18,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash 36210027, now seen corresponding path program 1 times [2025-01-09 22:41:18,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:18,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712533473] [2025-01-09 22:41:18,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:18,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:41:18,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:41:18,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:18,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:18,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:18,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:18,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712533473] [2025-01-09 22:41:18,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712533473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:18,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:18,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:41:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140533505] [2025-01-09 22:41:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:41:18,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:18,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:41:18,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:41:18,186 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 4 states, 4 states have (on average 6.25) 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-01-09 22:41:18,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:18,198 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2025-01-09 22:41:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:41:18,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) 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 31 [2025-01-09 22:41:18,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:18,198 INFO L225 Difference]: With dead ends: 112 [2025-01-09 22:41:18,199 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 22:41:18,199 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-01-09 22:41:18,199 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 84 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:18,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 215 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 22:41:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2025-01-09 22:41:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 107 states have internal predecessors, (118), 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-01-09 22:41:18,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2025-01-09 22:41:18,201 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 31 [2025-01-09 22:41:18,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:18,201 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2025-01-09 22:41:18,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) 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-01-09 22:41:18,201 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2025-01-09 22:41:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:41:18,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:18,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:18,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:41:18,202 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:18,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:18,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1116109562, now seen corresponding path program 1 times [2025-01-09 22:41:18,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:18,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518682453] [2025-01-09 22:41:18,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:18,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:18,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:41:18,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:41:18,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:18,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:18,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:18,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518682453] [2025-01-09 22:41:18,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518682453] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:18,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743072039] [2025-01-09 22:41:18,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:18,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:18,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:18,324 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-01-09 22:41:18,326 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-01-09 22:41:18,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:41:18,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:41:18,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:18,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:18,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:41:18,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:18,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:41:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743072039] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:41:18,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-01-09 22:41:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757870718] [2025-01-09 22:41:18,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:18,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:41:18,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:18,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:41:18,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:41:18,482 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-01-09 22:41:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:18,500 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2025-01-09 22:41:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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 32 [2025-01-09 22:41:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:18,501 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:41:18,501 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 22:41:18,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:41:18,501 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 77 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:18,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 221 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:41:18,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 22:41:18,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2025-01-09 22:41:18,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 104 states have internal predecessors, (114), 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-01-09 22:41:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2025-01-09 22:41:18,503 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 32 [2025-01-09 22:41:18,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:18,504 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2025-01-09 22:41:18,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 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-01-09 22:41:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2025-01-09 22:41:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:41:18,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:18,504 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:18,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:18,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:18,704 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:18,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:18,705 INFO L85 PathProgramCache]: Analyzing trace with hash 239664117, now seen corresponding path program 1 times [2025-01-09 22:41:18,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:18,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666678726] [2025-01-09 22:41:18,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:18,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:18,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:41:18,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:41:18,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:18,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:18,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666678726] [2025-01-09 22:41:18,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666678726] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:18,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031565371] [2025-01-09 22:41:18,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:18,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:18,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:18,884 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-01-09 22:41:18,889 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-01-09 22:41:18,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:41:19,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:41:19,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:19,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:19,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 22:41:19,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:19,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:19,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:41:19,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031565371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:19,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:41:19,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2025-01-09 22:41:19,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254405295] [2025-01-09 22:41:19,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:19,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:41:19,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:19,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:41:19,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:41:19,099 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 22:41:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:19,165 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2025-01-09 22:41:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:41:19,165 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 33 [2025-01-09 22:41:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:19,166 INFO L225 Difference]: With dead ends: 104 [2025-01-09 22:41:19,166 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 22:41:19,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:41:19,166 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:19,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 240 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 22:41:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 22:41:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 103 states have internal predecessors, (113), 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-01-09 22:41:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2025-01-09 22:41:19,168 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 33 [2025-01-09 22:41:19,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:19,168 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2025-01-09 22:41:19,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 22:41:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2025-01-09 22:41:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:41:19,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:19,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:19,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:41:19,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:19,374 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:19,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:19,375 INFO L85 PathProgramCache]: Analyzing trace with hash 239664116, now seen corresponding path program 1 times [2025-01-09 22:41:19,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:19,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774334801] [2025-01-09 22:41:19,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:19,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:19,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:41:19,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:41:19,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:19,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774334801] [2025-01-09 22:41:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774334801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:19,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:19,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:41:19,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024125442] [2025-01-09 22:41:19,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:19,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:41:19,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:19,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:41:19,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:41:19,432 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 22:41:19,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:19,529 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2025-01-09 22:41:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:41:19,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 33 [2025-01-09 22:41:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:19,530 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:41:19,530 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:41:19,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:41:19,531 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:19,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 202 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:19,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:41:19,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 22:41:19,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 102 states have internal predecessors, (112), 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-01-09 22:41:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2025-01-09 22:41:19,532 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 33 [2025-01-09 22:41:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:19,533 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2025-01-09 22:41:19,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-01-09 22:41:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2025-01-09 22:41:19,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:41:19,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:19,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:19,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:41:19,533 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:19,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:19,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1160327084, now seen corresponding path program 1 times [2025-01-09 22:41:19,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:19,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843637648] [2025-01-09 22:41:19,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:19,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:19,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:41:19,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:41:19,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:19,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:19,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:19,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843637648] [2025-01-09 22:41:19,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843637648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:19,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585522045] [2025-01-09 22:41:19,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:19,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:19,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:19,672 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-01-09 22:41:19,674 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-01-09 22:41:19,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:41:19,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:41:19,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:19,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:19,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 22:41:19,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:19,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:41:19,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:41:19,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585522045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:19,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:41:19,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2025-01-09 22:41:19,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228741841] [2025-01-09 22:41:19,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:19,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:41:19,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:19,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:41:19,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:41:19,900 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-01-09 22:41:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:19,997 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2025-01-09 22:41:19,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:41:19,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 34 [2025-01-09 22:41:19,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:19,998 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:41:19,998 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:41:19,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:41:19,999 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 20 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:19,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 322 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:41:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-01-09 22:41:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 99 states have internal predecessors, (109), 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-01-09 22:41:20,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2025-01-09 22:41:20,002 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 34 [2025-01-09 22:41:20,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:20,002 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2025-01-09 22:41:20,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-01-09 22:41:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2025-01-09 22:41:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:41:20,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:20,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:20,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:41:20,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:20,207 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:20,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1998986504, now seen corresponding path program 1 times [2025-01-09 22:41:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887304841] [2025-01-09 22:41:20,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:20,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:41:20,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:41:20,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:20,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:20,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887304841] [2025-01-09 22:41:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887304841] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028792988] [2025-01-09 22:41:20,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:20,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:20,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:20,946 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-01-09 22:41:20,952 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-01-09 22:41:21,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:41:21,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:41:21,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:21,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:21,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-01-09 22:41:21,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:21,603 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-01-09 22:41:21,661 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:41:21,661 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 17 treesize of output 21 [2025-01-09 22:41:21,707 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 11 treesize of output 7 [2025-01-09 22:41:21,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:41:21,771 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:21,772 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 34 treesize of output 33 [2025-01-09 22:41:21,881 INFO L349 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2025-01-09 22:41:21,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 57 [2025-01-09 22:41:21,966 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 50 treesize of output 33 [2025-01-09 22:41:21,983 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 50 treesize of output 33 [2025-01-09 22:41:22,001 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 50 treesize of output 33 [2025-01-09 22:41:22,083 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 66 treesize of output 38 [2025-01-09 22:41:22,225 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 33 treesize of output 17 [2025-01-09 22:41:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:22,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:22,503 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1716 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1716) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) 1)) is different from false [2025-01-09 22:41:22,517 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 34 treesize of output 26 [2025-01-09 22:41:22,520 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 30 treesize of output 22 [2025-01-09 22:41:26,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:26,762 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2025-01-09 22:41:26,766 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 180 treesize of output 162 [2025-01-09 22:41:26,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-01-09 22:41:26,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2025-01-09 22:41:31,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:31,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028792988] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:31,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:31,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 15] total 47 [2025-01-09 22:41:31,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058380775] [2025-01-09 22:41:31,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:31,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:41:31,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:31,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:41:31,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1962, Unknown=7, NotChecked=90, Total=2256 [2025-01-09 22:41:31,155 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 48 states, 47 states have (on average 2.234042553191489) internal successors, (105), 48 states have internal predecessors, (105), 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-01-09 22:41:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:32,528 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2025-01-09 22:41:32,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 22:41:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.234042553191489) internal successors, (105), 48 states have internal predecessors, (105), 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 37 [2025-01-09 22:41:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:32,532 INFO L225 Difference]: With dead ends: 106 [2025-01-09 22:41:32,532 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:41:32,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=363, Invalid=3056, Unknown=7, NotChecked=114, Total=3540 [2025-01-09 22:41:32,534 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 130 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:32,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1083 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1577 Invalid, 0 Unknown, 102 Unchecked, 0.9s Time] [2025-01-09 22:41:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:41:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 99. [2025-01-09 22:41:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 98 states have internal predecessors, (108), 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-01-09 22:41:32,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2025-01-09 22:41:32,541 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 37 [2025-01-09 22:41:32,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:32,541 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2025-01-09 22:41:32,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.234042553191489) internal successors, (105), 48 states have internal predecessors, (105), 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-01-09 22:41:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2025-01-09 22:41:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:41:32,541 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:32,541 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:32,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:32,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:32,742 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:32,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1998986503, now seen corresponding path program 1 times [2025-01-09 22:41:32,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:32,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140063921] [2025-01-09 22:41:32,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:32,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:32,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:41:32,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:41:32,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:32,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:33,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:33,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140063921] [2025-01-09 22:41:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140063921] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:33,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407299791] [2025-01-09 22:41:33,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:33,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:33,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:33,613 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-01-09 22:41:33,617 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-01-09 22:41:33,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:41:34,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:41:34,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:34,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:34,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 105 conjuncts are in the unsatisfiable core [2025-01-09 22:41:34,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:34,041 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-01-09 22:41:34,108 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:41:34,108 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 17 treesize of output 21 [2025-01-09 22:41:34,160 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 11 treesize of output 7 [2025-01-09 22:41:34,165 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 11 treesize of output 7 [2025-01-09 22:41:34,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:41:34,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:41:34,281 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:41:34,282 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 59 treesize of output 52 [2025-01-09 22:41:34,285 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 31 treesize of output 16 [2025-01-09 22:41:34,468 INFO L349 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2025-01-09 22:41:34,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 34 [2025-01-09 22:41:34,487 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-01-09 22:41:34,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2025-01-09 22:41:34,556 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 31 treesize of output 20 [2025-01-09 22:41:34,566 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 50 treesize of output 33 [2025-01-09 22:41:34,578 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 50 treesize of output 33 [2025-01-09 22:41:34,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2025-01-09 22:41:34,607 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 50 treesize of output 33 [2025-01-09 22:41:34,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2025-01-09 22:41:34,796 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 79 treesize of output 47 [2025-01-09 22:41:34,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:34,989 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 1 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:41:34,992 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 33 treesize of output 17 [2025-01-09 22:41:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:35,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:35,458 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_insert_~head#1.base|) |c_ULTIMATE.start_dll_insert_~head#1.offset|) 4))) (and (forall ((v_ArrVal_1910 (Array Int Int)) (v_ArrVal_1909 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1909) .cse0) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1910) .cse0) .cse1)))) (forall ((v_ArrVal_1909 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_1909) .cse0) .cse1) 8))))) is different from false [2025-01-09 22:41:35,490 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 76 treesize of output 60 [2025-01-09 22:41:35,493 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 64 treesize of output 48 [2025-01-09 22:41:35,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:35,785 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 119 treesize of output 123 [2025-01-09 22:41:37,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,678 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2025-01-09 22:41:37,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,686 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 37 [2025-01-09 22:41:37,691 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 75 treesize of output 63 [2025-01-09 22:41:37,697 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 150 treesize of output 126 [2025-01-09 22:41:37,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2025-01-09 22:41:37,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-01-09 22:41:37,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2025-01-09 22:41:37,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-01-09 22:41:37,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,754 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2025-01-09 22:41:37,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,762 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2025-01-09 22:41:37,765 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:37,767 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 50 treesize of output 32 [2025-01-09 22:41:37,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-01-09 22:41:37,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:37,773 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:37,774 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 18 treesize of output 12 [2025-01-09 22:41:37,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:41:37,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,785 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 51 [2025-01-09 22:41:37,787 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:37,789 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 61 treesize of output 43 [2025-01-09 22:41:37,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:41:37,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,804 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2025-01-09 22:41:37,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,812 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 36 [2025-01-09 22:41:37,815 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:37,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-01-09 22:41:37,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:41:37,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:37,821 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:37,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,824 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 28 treesize of output 16 [2025-01-09 22:41:37,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:41:37,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,836 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 53 [2025-01-09 22:41:37,838 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:37,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,841 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 75 treesize of output 51 [2025-01-09 22:41:37,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:41:37,854 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,854 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2025-01-09 22:41:37,856 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:41:37,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:37,858 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 50 treesize of output 32 [2025-01-09 22:41:37,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-01-09 22:41:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:41:38,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407299791] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:38,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:38,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 15] total 50 [2025-01-09 22:41:38,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124634192] [2025-01-09 22:41:38,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:38,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-01-09 22:41:38,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:38,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-01-09 22:41:38,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2266, Unknown=13, NotChecked=96, Total=2550 [2025-01-09 22:41:38,362 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 51 states, 50 states have (on average 2.16) internal successors, (108), 51 states have internal predecessors, (108), 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-01-09 22:41:41,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:41,002 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2025-01-09 22:41:41,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:41:41,003 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.16) internal successors, (108), 51 states have internal predecessors, (108), 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 37 [2025-01-09 22:41:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:41,003 INFO L225 Difference]: With dead ends: 105 [2025-01-09 22:41:41,003 INFO L226 Difference]: Without dead ends: 105 [2025-01-09 22:41:41,004 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=468, Invalid=4635, Unknown=13, NotChecked=140, Total=5256 [2025-01-09 22:41:41,005 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 137 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 97 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:41,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1293 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1914 Invalid, 0 Unknown, 97 Unchecked, 1.4s Time] [2025-01-09 22:41:41,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-01-09 22:41:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 98. [2025-01-09 22:41:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 97 states have internal predecessors, (107), 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-01-09 22:41:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2025-01-09 22:41:41,007 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 37 [2025-01-09 22:41:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:41,007 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2025-01-09 22:41:41,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.16) internal successors, (108), 51 states have internal predecessors, (108), 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-01-09 22:41:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2025-01-09 22:41:41,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:41:41,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:41,007 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:41,016 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-01-09 22:41:41,212 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,SelfDestructingSolverStorable22 [2025-01-09 22:41:41,212 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:41,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:41,212 INFO L85 PathProgramCache]: Analyzing trace with hash 482575647, now seen corresponding path program 1 times [2025-01-09 22:41:41,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522650737] [2025-01-09 22:41:41,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:41,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:41:41,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:41:41,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:41,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:41,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:41,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:41,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522650737] [2025-01-09 22:41:41,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522650737] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:41,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517965573] [2025-01-09 22:41:41,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:41,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:41,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:41,323 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-01-09 22:41:41,325 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-01-09 22:41:41,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 22:41:41,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:41:41,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:41,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:41,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:41:41,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:41,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:41,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:41,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517965573] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:41,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:41,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2025-01-09 22:41:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091605408] [2025-01-09 22:41:41,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:41,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:41:41,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:41,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:41:41,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:41:41,655 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 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-01-09 22:41:41,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:41,850 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-01-09 22:41:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:41:41,850 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 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 39 [2025-01-09 22:41:41,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:41,851 INFO L225 Difference]: With dead ends: 87 [2025-01-09 22:41:41,851 INFO L226 Difference]: Without dead ends: 87 [2025-01-09 22:41:41,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:41:41,852 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:41,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 863 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-09 22:41:41,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-01-09 22:41:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 86 states have internal predecessors, (94), 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-01-09 22:41:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-01-09 22:41:41,853 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 39 [2025-01-09 22:41:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:41,854 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-01-09 22:41:41,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 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-01-09 22:41:41,854 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-01-09 22:41:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:41:41,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:41,854 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:41,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-01-09 22:41:42,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:42,058 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash -43893094, now seen corresponding path program 1 times [2025-01-09 22:41:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:42,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044824561] [2025-01-09 22:41:42,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:42,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:42,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:41:42,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:41:42,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:42,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:42,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:42,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044824561] [2025-01-09 22:41:42,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044824561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:42,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:41:42,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:41:42,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616129983] [2025-01-09 22:41:42,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:42,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:41:42,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:42,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:41:42,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:41:42,282 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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-01-09 22:41:42,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:42,416 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2025-01-09 22:41:42,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:41:42,417 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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 41 [2025-01-09 22:41:42,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:42,417 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:41:42,417 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:41:42,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:41:42,418 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 60 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:42,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 417 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:42,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:41:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2025-01-09 22:41:42,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 87 states have internal predecessors, (95), 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-01-09 22:41:42,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2025-01-09 22:41:42,424 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 41 [2025-01-09 22:41:42,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:42,424 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2025-01-09 22:41:42,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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-01-09 22:41:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2025-01-09 22:41:42,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:41:42,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:42,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:42,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:41:42,424 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:42,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:42,425 INFO L85 PathProgramCache]: Analyzing trace with hash -43893542, now seen corresponding path program 1 times [2025-01-09 22:41:42,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:42,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842334789] [2025-01-09 22:41:42,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:42,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:42,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:41:42,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:41:42,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:42,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:41:42,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842334789] [2025-01-09 22:41:42,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842334789] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:42,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232155194] [2025-01-09 22:41:42,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:42,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:42,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:42,560 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:41:42,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:41:42,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:41:42,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:41:42,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:42,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:42,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:41:42,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:42,736 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-01-09 22:41:42,783 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-09 22:41:42,783 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 23 treesize of output 24 [2025-01-09 22:41:42,807 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 17 treesize of output 9 [2025-01-09 22:41:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:41:42,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:41:42,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232155194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:42,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:41:42,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-01-09 22:41:42,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788288688] [2025-01-09 22:41:42,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:42,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:41:42,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:42,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:41:42,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:41:42,813 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-01-09 22:41:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:42,976 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2025-01-09 22:41:42,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:41:42,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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 41 [2025-01-09 22:41:42,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:42,977 INFO L225 Difference]: With dead ends: 90 [2025-01-09 22:41:42,977 INFO L226 Difference]: Without dead ends: 90 [2025-01-09 22:41:42,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:41:42,978 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 54 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:42,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 260 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:42,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-01-09 22:41:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-01-09 22:41:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 85 states have internal predecessors, (94), 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-01-09 22:41:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2025-01-09 22:41:42,981 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 41 [2025-01-09 22:41:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:42,981 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2025-01-09 22:41:42,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-01-09 22:41:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2025-01-09 22:41:42,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:41:42,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:42,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:42,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 22:41:43,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:43,182 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:43,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash -43893541, now seen corresponding path program 1 times [2025-01-09 22:41:43,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:43,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361204707] [2025-01-09 22:41:43,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:43,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:43,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:41:43,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:41:43,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:43,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:43,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:43,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361204707] [2025-01-09 22:41:43,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361204707] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897032168] [2025-01-09 22:41:43,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:43,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:43,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:43,472 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:41:43,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:41:43,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:41:43,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:41:43,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:43,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:43,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:41:43,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:43,666 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-01-09 22:41:43,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-01-09 22:41:43,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:41:43,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-09 22:41:43,754 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:41:43,754 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 15 treesize of output 15 [2025-01-09 22:41:43,820 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 17 treesize of output 9 [2025-01-09 22:41:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:41:43,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:41:43,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897032168] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:41:43,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:41:43,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 19 [2025-01-09 22:41:43,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706288612] [2025-01-09 22:41:43,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:41:43,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:41:43,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:43,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:41:43,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:41:43,857 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-01-09 22:41:44,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:41:44,045 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2025-01-09 22:41:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:41:44,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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 41 [2025-01-09 22:41:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:41:44,046 INFO L225 Difference]: With dead ends: 88 [2025-01-09 22:41:44,046 INFO L226 Difference]: Without dead ends: 88 [2025-01-09 22:41:44,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:41:44,046 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 49 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:41:44,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 253 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:41:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-01-09 22:41:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-01-09 22:41:44,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 87 states have internal predecessors, (95), 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-01-09 22:41:44,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2025-01-09 22:41:44,048 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 41 [2025-01-09 22:41:44,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:41:44,048 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2025-01-09 22:41:44,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-01-09 22:41:44,048 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2025-01-09 22:41:44,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:41:44,048 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:41:44,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:41:44,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 22:41:44,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-01-09 22:41:44,253 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:41:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:41:44,253 INFO L85 PathProgramCache]: Analyzing trace with hash -323328839, now seen corresponding path program 1 times [2025-01-09 22:41:44,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:41:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643941138] [2025-01-09 22:41:44,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:41:44,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:41:44,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:41:44,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:44,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:44,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:41:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643941138] [2025-01-09 22:41:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643941138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:41:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977200615] [2025-01-09 22:41:44,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:41:44,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:41:44,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:41:44,714 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:41:44,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:41:44,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:41:44,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:41:44,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:41:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:41:44,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-09 22:41:44,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:41:44,906 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-01-09 22:41:44,948 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:41:44,949 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 17 treesize of output 21 [2025-01-09 22:41:44,980 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 13 treesize of output 9 [2025-01-09 22:41:45,008 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 29 treesize of output 13 [2025-01-09 22:41:45,023 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:41:45,024 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-01-09 22:41:45,118 INFO L349 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2025-01-09 22:41:45,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2025-01-09 22:41:45,168 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 68 treesize of output 51 [2025-01-09 22:41:45,181 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 68 treesize of output 51 [2025-01-09 22:41:45,194 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 68 treesize of output 51 [2025-01-09 22:41:45,366 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-01-09 22:41:45,366 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 73 treesize of output 60 [2025-01-09 22:41:45,465 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:41:45,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 114 treesize of output 98 [2025-01-09 22:41:45,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:41:45,554 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 105 treesize of output 82 [2025-01-09 22:41:45,736 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 164 treesize of output 116 [2025-01-09 22:41:45,739 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 115 treesize of output 87 [2025-01-09 22:41:45,911 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 93 treesize of output 51 [2025-01-09 22:41:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:46,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:41:46,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2682 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2682) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2025-01-09 22:41:50,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2682 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2682) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2025-01-09 22:41:54,561 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2682 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2682) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2025-01-09 22:41:54,568 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2679 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2682 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2679) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2682) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 1)) is different from false [2025-01-09 22:41:54,583 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 47 treesize of output 39 [2025-01-09 22:41:54,585 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 43 treesize of output 35 [2025-01-09 22:41:54,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:54,932 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2025-01-09 22:41:54,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:41:54,943 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 4592 treesize of output 4518 [2025-01-09 22:41:54,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 251 [2025-01-09 22:41:54,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 241 [2025-01-09 22:41:54,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 66 [2025-01-09 22:41:55,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:41:59,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:41:59,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977200615] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:41:59,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:41:59,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 20] total 54 [2025-01-09 22:41:59,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780689335] [2025-01-09 22:41:59,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:41:59,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-01-09 22:41:59,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:41:59,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-01-09 22:41:59,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2265, Unknown=33, NotChecked=396, Total=2862 [2025-01-09 22:41:59,844 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 54 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 54 states have internal predecessors, (134), 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-01-09 22:42:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:42:14,506 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2025-01-09 22:42:14,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 22:42:14,506 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 54 states have internal predecessors, (134), 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 46 [2025-01-09 22:42:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:42:14,507 INFO L225 Difference]: With dead ends: 106 [2025-01-09 22:42:14,507 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:42:14,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=395, Invalid=4695, Unknown=38, NotChecked=572, Total=5700 [2025-01-09 22:42:14,508 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 153 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 2078 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 2506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 405 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:42:14,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1104 Invalid, 2506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2078 Invalid, 0 Unknown, 405 Unchecked, 1.2s Time] [2025-01-09 22:42:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:42:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2025-01-09 22:42:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 91 states have internal predecessors, (102), 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-01-09 22:42:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2025-01-09 22:42:14,510 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 46 [2025-01-09 22:42:14,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:42:14,510 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2025-01-09 22:42:14,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.4814814814814814) internal successors, (134), 54 states have internal predecessors, (134), 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-01-09 22:42:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2025-01-09 22:42:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:42:14,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:42:14,511 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:42:14,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-01-09 22:42:14,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-01-09 22:42:14,715 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2025-01-09 22:42:14,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:42:14,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1641807063, now seen corresponding path program 1 times [2025-01-09 22:42:14,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:42:14,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283033365] [2025-01-09 22:42:14,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:42:14,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:42:14,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:42:14,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:14,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:42:16,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:42:16,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283033365] [2025-01-09 22:42:16,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283033365] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:42:16,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309287237] [2025-01-09 22:42:16,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:42:16,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:42:16,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:42:16,779 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:42:16,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 22:42:16,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:42:16,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:42:16,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:42:16,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:42:16,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-01-09 22:42:16,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:42:16,999 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-01-09 22:42:17,002 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-01-09 22:42:17,095 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:42:17,095 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 17 treesize of output 21 [2025-01-09 22:42:17,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:42:17,160 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 13 treesize of output 9 [2025-01-09 22:42:17,165 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 13 treesize of output 9 [2025-01-09 22:42:17,219 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 23 treesize of output 22 [2025-01-09 22:42:17,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-01-09 22:42:17,305 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:42:17,305 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-01-09 22:42:17,308 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 39 treesize of output 20 [2025-01-09 22:42:17,489 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-01-09 22:42:17,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2025-01-09 22:42:17,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-01-09 22:42:17,578 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 68 treesize of output 51 [2025-01-09 22:42:17,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-01-09 22:42:17,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 68 treesize of output 51 [2025-01-09 22:42:17,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-01-09 22:42:17,620 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 68 treesize of output 51 [2025-01-09 22:42:17,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-01-09 22:42:17,917 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-01-09 22:42:17,917 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 73 treesize of output 60 [2025-01-09 22:42:17,939 INFO L349 Elim1Store]: treesize reduction 104, result has 25.2 percent of original size [2025-01-09 22:42:17,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2025-01-09 22:42:18,087 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:42:18,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 123 treesize of output 107 [2025-01-09 22:42:18,101 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-01-09 22:42:18,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 155 treesize of output 151 [2025-01-09 22:42:18,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-01-09 22:42:18,176 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 22:42:18,295 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 105 treesize of output 82 [2025-01-09 22:42:18,312 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 43 treesize of output 32 [2025-01-09 22:42:18,373 INFO L349 Elim1Store]: treesize reduction 43, result has 44.9 percent of original size [2025-01-09 22:42:18,374 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 134 treesize of output 94 [2025-01-09 22:42:18,396 INFO L349 Elim1Store]: treesize reduction 104, result has 25.2 percent of original size [2025-01-09 22:42:18,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 48 treesize of output 50 [2025-01-09 22:42:22,669 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 297 treesize of output 233 [2025-01-09 22:42:22,672 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 237 treesize of output 197 [2025-01-09 22:42:23,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:23,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 185 treesize of output 135 [2025-01-09 22:42:23,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:23,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 110 treesize of output 150 [2025-01-09 22:42:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:42:36,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:42:37,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2893))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse1) .cse2))) (forall ((v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_2892 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8))) (<= (+ (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2893))) (store .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse1) .cse2) 4) (select |c_#length| (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2892))) (store .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse1) .cse2))))))) is different from false [2025-01-09 22:42:37,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2893))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse1) .cse2))) (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_2892 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse5 (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (<= (+ (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2893))) (store .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.offset|))) .cse1) .cse2) 4) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_insert_~new_node~0#1.base| v_ArrVal_2892))) (store .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_dll_insert_~new_node~0#1.base|))) .cse1) .cse2))))))) is different from false [2025-01-09 22:42:37,347 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2893))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse1) .cse2))) (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_2892 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse5 (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (<= (+ 4 (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_#res#1.offset|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2893))) (store .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_node_create_#res#1.offset|))) .cse1) .cse2)) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_#res#1.base|)) |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2892))) (store .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_node_create_#res#1.base|))) .cse1) .cse2))))))) is different from false [2025-01-09 22:42:37,361 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_2892 (Array Int Int))) (let ((.cse1 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse2 (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (<= (+ (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2893))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse3) .cse4) 4) (select |c_#length| (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse2 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2892))) (store .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse5 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) .cse3) .cse4))))) (forall ((|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2893))) (store .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse3) .cse4))))) is different from false [2025-01-09 22:42:37,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_2886 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int)) (<= 0 (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2886) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|) |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2893))) (store .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse0 |ULTIMATE.start_dll_insert_~last~0#1.base|) (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8) |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse1) .cse2))) (forall ((v_ArrVal_2886 (Array Int Int)) (v_ArrVal_2885 (Array Int Int)) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| Int) (|ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset| Int) (v_ArrVal_2893 (Array Int Int)) (|ULTIMATE.start_dll_insert_~last~0#1.offset| Int) (|ULTIMATE.start_dll_insert_~last~0#1.base| Int) (v_ArrVal_2892 (Array Int Int))) (let ((.cse4 (+ |ULTIMATE.start_dll_insert_~last~0#1.offset| 8)) (.cse5 (+ 4 |ULTIMATE.start_dll_insert_~snd_to_last~0#1.offset|))) (<= (+ (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2886) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2893))) (store .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse3 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) .cse1) .cse2) 4) (select |c_#length| (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2885) |ULTIMATE.start_dll_insert_~snd_to_last~0#1.base|) .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2892))) (store .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base| (store (select .cse6 |ULTIMATE.start_dll_insert_~last~0#1.base|) .cse4 |c_ULTIMATE.start_node_create_~temp~0#1.base|))) .cse1) .cse2))))))) is different from false [2025-01-09 22:42:37,429 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 191 treesize of output 175 [2025-01-09 22:42:37,432 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 179 treesize of output 163 [2025-01-09 22:42:42,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:42,576 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 250 treesize of output 211 [2025-01-09 22:42:42,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:42,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 9680672 treesize of output 9663350 [2025-01-09 22:42:43,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:43,400 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 70454 treesize of output 41914 [2025-01-09 22:42:43,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:42:43,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 147915018 treesize of output 146498462