./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0235-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0235-3.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 02c65307022e35fe6a7161faa785e5b34e94ccda4b82967e279eadaf3aa37bc3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:17:43,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:17:43,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:17:43,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:17:43,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:17:43,917 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:17:43,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:17:43,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:17:43,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:17:43,919 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:17:43,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:17:43,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:17:43,920 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:17:43,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:17:43,920 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:17:43,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:17:43,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:17:43,922 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:17:43,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:17:43,922 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:17:43,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:17:43,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:17:43,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:17:43,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:17:43,923 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:17:43,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:17:43,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:17:43,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:17:43,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:17:43,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:17:43,923 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 -> 02c65307022e35fe6a7161faa785e5b34e94ccda4b82967e279eadaf3aa37bc3 [2025-02-06 10:17:44,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:17:44,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:17:44,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:17:44,145 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:17:44,145 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:17:44,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0235-3.i [2025-02-06 10:17:45,460 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7cc11e92/5ec871fe95464f3991e9e00cfb9b7614/FLAG3cace2061 [2025-02-06 10:17:45,853 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:17:45,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0235-3.i [2025-02-06 10:17:45,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7cc11e92/5ec871fe95464f3991e9e00cfb9b7614/FLAG3cace2061 [2025-02-06 10:17:46,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7cc11e92/5ec871fe95464f3991e9e00cfb9b7614 [2025-02-06 10:17:46,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:17:46,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:17:46,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:17:46,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:17:46,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:17:46,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17654bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46, skipping insertion in model container [2025-02-06 10:17:46,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:17:46,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:17:46,377 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:17:46,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:17:46,426 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:17:46,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46 WrapperNode [2025-02-06 10:17:46,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:17:46,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:17:46,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:17:46,428 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:17:46,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,440 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,457 INFO L138 Inliner]: procedures = 188, calls = 73, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 236 [2025-02-06 10:17:46,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:17:46,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:17:46,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:17:46,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:17:46,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,494 INFO L175 MemorySlicer]: Split 39 memory accesses to 3 slices as follows [2, 11, 26]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 13 writes are split as follows [0, 1, 12]. [2025-02-06 10:17:46,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:17:46,522 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:17:46,522 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:17:46,522 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:17:46,523 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (1/1) ... [2025-02-06 10:17:46,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:17:46,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:46,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:17:46,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:17:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:17:46,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:17:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:17:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:17:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-06 10:17:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:17:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:17:46,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2025-02-06 10:17:46,574 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2025-02-06 10:17:46,574 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 10:17:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:17:46,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:17:46,693 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:17:46,695 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:17:46,914 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc calloc_model_#t~memset~res4#1.base, calloc_model_#t~memset~res4#1.offset; [2025-02-06 10:17:47,101 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L788: havoc main_#t~mem39#1.base, main_#t~mem39#1.offset; [2025-02-06 10:17:47,140 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-02-06 10:17:47,143 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:17:47,154 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:17:47,154 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:17:47,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:17:47 BoogieIcfgContainer [2025-02-06 10:17:47,159 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:17:47,160 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:17:47,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:17:47,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:17:47,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:17:46" (1/3) ... [2025-02-06 10:17:47,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2485f6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:17:47, skipping insertion in model container [2025-02-06 10:17:47,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:46" (2/3) ... [2025-02-06 10:17:47,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2485f6aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:17:47, skipping insertion in model container [2025-02-06 10:17:47,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:17:47" (3/3) ... [2025-02-06 10:17:47,166 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0235-3.i [2025-02-06 10:17:47,176 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:17:47,177 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0235-3.i that has 3 procedures, 243 locations, 1 initial locations, 11 loop locations, and 89 error locations. [2025-02-06 10:17:47,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:17:47,215 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;@185c7e7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:17:47,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 89 error locations. [2025-02-06 10:17:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 138 states have (on average 1.8768115942028984) internal successors, (259), 227 states have internal predecessors, (259), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:17:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:17:47,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:47,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:17:47,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:17:47,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:47,238 INFO L85 PathProgramCache]: Analyzing trace with hash 9418789, now seen corresponding path program 1 times [2025-02-06 10:17:47,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:47,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025402791] [2025-02-06 10:17:47,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:47,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:17:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:17:47,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:47,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:47,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025402791] [2025-02-06 10:17:47,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025402791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:47,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:47,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:47,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548100871] [2025-02-06 10:17:47,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:47,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:17:47,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:47,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:17:47,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:17:47,358 INFO L87 Difference]: Start difference. First operand has 243 states, 138 states have (on average 1.8768115942028984) internal successors, (259), 227 states have internal predecessors, (259), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:47,379 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2025-02-06 10:17:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:17:47,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:17:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:47,385 INFO L225 Difference]: With dead ends: 243 [2025-02-06 10:17:47,385 INFO L226 Difference]: Without dead ends: 241 [2025-02-06 10:17:47,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:17:47,388 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:47,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:17:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-02-06 10:17:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2025-02-06 10:17:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 137 states have (on average 1.7956204379562044) internal successors, (246), 225 states have internal predecessors, (246), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:17:47,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2025-02-06 10:17:47,455 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 4 [2025-02-06 10:17:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:47,456 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2025-02-06 10:17:47,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2025-02-06 10:17:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:17:47,456 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:47,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:17:47,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:17:47,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting zalloc_or_dieErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:17:47,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 461610684, now seen corresponding path program 1 times [2025-02-06 10:17:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136744356] [2025-02-06 10:17:47,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:47,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:17:47,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:17:47,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:47,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:47,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:47,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:47,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136744356] [2025-02-06 10:17:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136744356] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:47,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:47,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:47,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026848163] [2025-02-06 10:17:47,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:47,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:47,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:47,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:47,550 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:47,656 INFO L93 Difference]: Finished difference Result 240 states and 271 transitions. [2025-02-06 10:17:47,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:47,657 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:17:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:47,658 INFO L225 Difference]: With dead ends: 240 [2025-02-06 10:17:47,658 INFO L226 Difference]: Without dead ends: 240 [2025-02-06 10:17:47,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:47,659 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:47,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 447 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-06 10:17:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2025-02-06 10:17:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 137 states have (on average 1.7883211678832116) internal successors, (245), 224 states have internal predecessors, (245), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:17:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2025-02-06 10:17:47,677 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 6 [2025-02-06 10:17:47,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:47,677 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2025-02-06 10:17:47,678 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2025-02-06 10:17:47,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:17:47,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:47,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:47,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:17:47,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:17:47,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1425029422, now seen corresponding path program 1 times [2025-02-06 10:17:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899539862] [2025-02-06 10:17:47,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:47,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:17:47,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:17:47,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:47,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:47,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071003979] [2025-02-06 10:17:47,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:47,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:47,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:47,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:47,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 10:17:47,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:17:47,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:17:47,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:47,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:47,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:17:47,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:47,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:17:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:47,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:17:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899539862] [2025-02-06 10:17:47,964 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:47,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071003979] [2025-02-06 10:17:47,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071003979] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:47,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:47,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:17:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478303820] [2025-02-06 10:17:47,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:47,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:17:47,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:47,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:17:47,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:17:47,965 INFO L87 Difference]: Start difference. First operand 240 states and 271 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:48,191 INFO L93 Difference]: Finished difference Result 249 states and 280 transitions. [2025-02-06 10:17:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:17:48,192 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-06 10:17:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:48,193 INFO L225 Difference]: With dead ends: 249 [2025-02-06 10:17:48,197 INFO L226 Difference]: Without dead ends: 249 [2025-02-06 10:17:48,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:48,198 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 11 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:48,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 710 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-02-06 10:17:48,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2025-02-06 10:17:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 145 states have (on average 1.7517241379310344) internal successors, (254), 232 states have internal predecessors, (254), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:17:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 280 transitions. [2025-02-06 10:17:48,221 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 280 transitions. Word has length 7 [2025-02-06 10:17:48,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:48,221 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 280 transitions. [2025-02-06 10:17:48,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:48,221 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 280 transitions. [2025-02-06 10:17:48,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-06 10:17:48,226 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:48,227 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:48,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:17:48,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:48,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:17:48,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 427405056, now seen corresponding path program 1 times [2025-02-06 10:17:48,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:48,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43859003] [2025-02-06 10:17:48,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:48,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:48,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:17:48,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:17:48,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:48,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:48,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1080229958] [2025-02-06 10:17:48,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:48,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:48,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:48,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:48,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 10:17:48,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 10:17:48,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 10:17:48,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:48,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:48,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 10:17:48,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:48,714 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 7 [2025-02-06 10:17:48,762 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 13 treesize of output 9 [2025-02-06 10:17:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-06 10:17:48,839 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:17:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43859003] [2025-02-06 10:17:48,839 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080229958] [2025-02-06 10:17:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080229958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:48,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:48,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:17:48,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414951963] [2025-02-06 10:17:48,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:48,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:17:48,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:48,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:17:48,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:48,844 INFO L87 Difference]: Start difference. First operand 249 states and 280 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:17:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:48,978 INFO L93 Difference]: Finished difference Result 261 states and 292 transitions. [2025-02-06 10:17:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:17:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 66 [2025-02-06 10:17:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:48,979 INFO L225 Difference]: With dead ends: 261 [2025-02-06 10:17:48,979 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 10:17:48,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:17:48,980 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 3 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:48,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 972 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:48,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 10:17:48,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-02-06 10:17:48,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 147 states have (on average 1.7414965986394557) internal successors, (256), 234 states have internal predecessors, (256), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:17:48,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 282 transitions. [2025-02-06 10:17:48,987 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 282 transitions. Word has length 66 [2025-02-06 10:17:48,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:48,987 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 282 transitions. [2025-02-06 10:17:48,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-06 10:17:48,987 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 282 transitions. [2025-02-06 10:17:48,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-06 10:17:48,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:48,988 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:48,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:17:49,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:49,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:17:49,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash 642629336, now seen corresponding path program 1 times [2025-02-06 10:17:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009373146] [2025-02-06 10:17:49,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:49,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 10:17:49,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:17:49,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:49,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:49,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1377950471] [2025-02-06 10:17:49,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:49,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:49,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:49,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:49,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 10:17:49,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 10:17:49,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 10:17:49,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:49,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:49,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 10:17:49,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:49,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 8 treesize of output 1 [2025-02-06 10:17:49,633 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 13 treesize of output 9 [2025-02-06 10:17:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 92 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-06 10:17:49,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 48 proven. 12 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-02-06 10:17:49,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009373146] [2025-02-06 10:17:49,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:49,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377950471] [2025-02-06 10:17:49,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377950471] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:17:49,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:17:49,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2025-02-06 10:17:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605924578] [2025-02-06 10:17:49,890 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:49,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:17:49,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:49,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:17:49,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:17:49,892 INFO L87 Difference]: Start difference. First operand 251 states and 282 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 10:17:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:50,193 INFO L93 Difference]: Finished difference Result 270 states and 302 transitions. [2025-02-06 10:17:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:17:50,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2025-02-06 10:17:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:50,194 INFO L225 Difference]: With dead ends: 270 [2025-02-06 10:17:50,194 INFO L226 Difference]: Without dead ends: 255 [2025-02-06 10:17:50,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:17:50,195 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 17 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:50,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1502 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-06 10:17:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2025-02-06 10:17:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 151 states have (on average 1.7218543046357615) internal successors, (260), 238 states have internal predecessors, (260), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:17:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 286 transitions. [2025-02-06 10:17:50,206 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 286 transitions. Word has length 71 [2025-02-06 10:17:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:50,206 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 286 transitions. [2025-02-06 10:17:50,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-06 10:17:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 286 transitions. [2025-02-06 10:17:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-06 10:17:50,209 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:50,209 INFO L218 NwaCegarLoop]: trace histogram [20, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:50,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:17:50,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:50,413 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting zalloc_or_dieErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:17:50,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash -127394560, now seen corresponding path program 2 times [2025-02-06 10:17:50,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:50,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374837587] [2025-02-06 10:17:50,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:17:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:50,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-02-06 10:17:50,558 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 10:17:50,558 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:17:50,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [8053550] [2025-02-06 10:17:50,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:17:50,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:50,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:50,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:50,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:17:50,696 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-02-06 10:17:50,926 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 10:17:50,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:17:50,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:50,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:17:50,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:50,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:17:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-02-06 10:17:50,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:17:50,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374837587] [2025-02-06 10:17:50,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8053550] [2025-02-06 10:17:50,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8053550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:50,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:50,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:17:50,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126153692] [2025-02-06 10:17:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:50,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:17:50,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:50,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:17:50,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:17:50,977 INFO L87 Difference]: Start difference. First operand 255 states and 286 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 10:17:51,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:51,087 INFO L93 Difference]: Finished difference Result 254 states and 285 transitions. [2025-02-06 10:17:51,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:17:51,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2025-02-06 10:17:51,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:51,088 INFO L225 Difference]: With dead ends: 254 [2025-02-06 10:17:51,088 INFO L226 Difference]: Without dead ends: 254 [2025-02-06 10:17:51,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:51,089 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 11 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:51,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 732 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-02-06 10:17:51,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2025-02-06 10:17:51,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 151 states have (on average 1.7152317880794703) internal successors, (259), 237 states have internal predecessors, (259), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:17:51,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2025-02-06 10:17:51,095 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 86 [2025-02-06 10:17:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:51,096 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2025-02-06 10:17:51,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-06 10:17:51,096 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2025-02-06 10:17:51,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 10:17:51,097 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:51,097 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:51,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:17:51,297 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,SelfDestructingSolverStorable5 [2025-02-06 10:17:51,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:17:51,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash 630215530, now seen corresponding path program 1 times [2025-02-06 10:17:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:51,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559651434] [2025-02-06 10:17:51,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:51,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:51,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 10:17:51,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 10:17:51,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:51,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-02-06 10:17:52,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:52,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559651434] [2025-02-06 10:17:52,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559651434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:17:52,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95722283] [2025-02-06 10:17:52,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:52,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:52,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:52,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:52,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:17:52,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 10:17:52,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 10:17:52,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:52,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:52,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 10:17:52,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:52,677 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-02-06 10:17:52,723 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:17:52,723 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-02-06 10:17:52,739 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 1 refuted. 0 times theorem prover too weak. 255 trivial. 21 not checked. [2025-02-06 10:17:52,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:52,967 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:17:52,967 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 12 treesize of output 11 [2025-02-06 10:17:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 221 proven. 22 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-02-06 10:17:52,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95722283] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:17:52,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:17:52,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 15 [2025-02-06 10:17:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706247892] [2025-02-06 10:17:52,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:52,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 10:17:52,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:53,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 10:17:53,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2025-02-06 10:17:53,000 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 10:17:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:53,746 INFO L93 Difference]: Finished difference Result 358 states and 410 transitions. [2025-02-06 10:17:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:17:53,747 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2025-02-06 10:17:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:53,749 INFO L225 Difference]: With dead ends: 358 [2025-02-06 10:17:53,750 INFO L226 Difference]: Without dead ends: 358 [2025-02-06 10:17:53,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 182 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2025-02-06 10:17:53,752 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 247 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1942 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 387 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:53,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1942 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1056 Invalid, 0 Unknown, 387 Unchecked, 0.6s Time] [2025-02-06 10:17:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-06 10:17:53,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 252. [2025-02-06 10:17:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 151 states have (on average 1.7019867549668874) internal successors, (257), 235 states have internal predecessors, (257), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:17:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2025-02-06 10:17:53,763 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 95 [2025-02-06 10:17:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:53,763 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2025-02-06 10:17:53,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.0) internal successors, (60), 14 states have internal predecessors, (60), 2 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 10:17:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2025-02-06 10:17:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-06 10:17:53,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:53,766 INFO L218 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:53,775 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-02-06 10:17:53,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:53,967 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:17:53,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash 630215531, now seen corresponding path program 1 times [2025-02-06 10:17:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:53,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932310808] [2025-02-06 10:17:53,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:53,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 10:17:54,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 10:17:54,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:54,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:17:54,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [517448236] [2025-02-06 10:17:54,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:54,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:54,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:54,105 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:17:54,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:17:54,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 10:17:54,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 10:17:54,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:54,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:54,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-06 10:17:54,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:54,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:17:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 209 proven. 83 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-02-06 10:17:55,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:55,607 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 110 proven. 3 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-02-06 10:17:55,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932310808] [2025-02-06 10:17:55,608 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:17:55,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517448236] [2025-02-06 10:17:55,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517448236] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:17:55,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:17:55,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 27 [2025-02-06 10:17:55,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721199814] [2025-02-06 10:17:55,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:17:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:17:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:55,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:17:55,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:17:55,610 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 24 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 10:17:59,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:03,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:08,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:17,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:21,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:26,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:30,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:32,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-02-06 10:18:35,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:35,574 INFO L93 Difference]: Finished difference Result 372 states and 426 transitions. [2025-02-06 10:18:35,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 10:18:35,574 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 24 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2025-02-06 10:18:35,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:35,577 INFO L225 Difference]: With dead ends: 372 [2025-02-06 10:18:35,577 INFO L226 Difference]: Without dead ends: 362 [2025-02-06 10:18:35,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=317, Invalid=1844, Unknown=1, NotChecked=0, Total=2162 [2025-02-06 10:18:35,578 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 176 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 44 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 3759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:35,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1481 Invalid, 3759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3708 Invalid, 7 Unknown, 0 Unchecked, 32.7s Time] [2025-02-06 10:18:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-06 10:18:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 256. [2025-02-06 10:18:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 155 states have (on average 1.6838709677419355) internal successors, (261), 239 states have internal predecessors, (261), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:18:35,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 287 transitions. [2025-02-06 10:18:35,589 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 287 transitions. Word has length 95 [2025-02-06 10:18:35,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:35,589 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 287 transitions. [2025-02-06 10:18:35,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.269230769230769) internal successors, (59), 24 states have internal predecessors, (59), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-06 10:18:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 287 transitions. [2025-02-06 10:18:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-06 10:18:35,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:35,591 INFO L218 NwaCegarLoop]: trace histogram [26, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:35,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:18:35,791 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,SelfDestructingSolverStorable7 [2025-02-06 10:18:35,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:18:35,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:35,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1480902293, now seen corresponding path program 2 times [2025-02-06 10:18:35,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:35,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714386706] [2025-02-06 10:18:35,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:18:35,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:35,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-06 10:18:35,940 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 10:18:35,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:18:35,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 10:18:35,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [781447983] [2025-02-06 10:18:35,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:18:35,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:35,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:35,949 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:35,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:18:36,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-06 10:18:36,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-02-06 10:18:36,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:18:36,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:36,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-06 10:18:36,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:36,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:18:36,430 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 13 treesize of output 9 [2025-02-06 10:18:36,560 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 375 proven. 56 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-02-06 10:18:36,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 64 proven. 116 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-02-06 10:18:36,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:36,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714386706] [2025-02-06 10:18:36,941 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 10:18:36,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781447983] [2025-02-06 10:18:36,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781447983] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:36,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:18:36,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2025-02-06 10:18:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758116347] [2025-02-06 10:18:36,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:36,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:18:36,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:36,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:18:36,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:18:36,942 INFO L87 Difference]: Start difference. First operand 256 states and 287 transitions. Second operand has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 10:18:45,233 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification. DAG size of input: 45 DAG size of output: 36 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-06 10:18:53,314 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 38 DAG size of output: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-02-06 10:18:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:53,855 INFO L93 Difference]: Finished difference Result 272 states and 307 transitions. [2025-02-06 10:18:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:18:53,856 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2025-02-06 10:18:53,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:53,857 INFO L225 Difference]: With dead ends: 272 [2025-02-06 10:18:53,857 INFO L226 Difference]: Without dead ends: 262 [2025-02-06 10:18:53,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=307, Invalid=953, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 10:18:53,858 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 28 mSDsluCounter, 3215 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:53,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3478 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:18:53,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-02-06 10:18:53,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2025-02-06 10:18:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 161 states have (on average 1.6645962732919255) internal successors, (268), 245 states have internal predecessors, (268), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:18:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 294 transitions. [2025-02-06 10:18:53,877 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 294 transitions. Word has length 99 [2025-02-06 10:18:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:53,877 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 294 transitions. [2025-02-06 10:18:53,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.0) internal successors, (60), 20 states have internal predecessors, (60), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2025-02-06 10:18:53,878 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 294 transitions. [2025-02-06 10:18:53,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-06 10:18:53,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:53,878 INFO L218 NwaCegarLoop]: trace histogram [46, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:53,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:54,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:54,079 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:18:54,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:54,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1406503787, now seen corresponding path program 3 times [2025-02-06 10:18:54,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:54,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696304805] [2025-02-06 10:18:54,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:18:54,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:54,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 18 equivalence classes. [2025-02-06 10:18:54,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 73 of 119 statements. [2025-02-06 10:18:54,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 10:18:54,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 637 proven. 106 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-02-06 10:18:55,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696304805] [2025-02-06 10:18:55,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696304805] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:55,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186901872] [2025-02-06 10:18:55,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:18:55,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:55,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:55,875 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:18:55,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:18:56,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 119 statements into 18 equivalence classes. [2025-02-06 10:18:56,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 43 of 119 statements. [2025-02-06 10:18:56,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:18:56,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:56,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-06 10:18:56,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:56,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-06 10:18:56,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:18:56,612 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-02-06 10:18:56,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:56,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:18:56,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:56,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-06 10:18:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 637 proven. 0 refuted. 0 times theorem prover too weak. 739 trivial. 70 not checked. [2025-02-06 10:18:56,702 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:56,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186901872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:56,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:18:56,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11] total 29 [2025-02-06 10:18:56,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368329964] [2025-02-06 10:18:56,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:56,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-06 10:18:56,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:56,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-06 10:18:56,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=851, Unknown=1, NotChecked=58, Total=992 [2025-02-06 10:18:56,835 INFO L87 Difference]: Start difference. First operand 262 states and 294 transitions. Second operand has 30 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 10:19:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:00,652 INFO L93 Difference]: Finished difference Result 373 states and 428 transitions. [2025-02-06 10:19:00,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:19:00,652 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 119 [2025-02-06 10:19:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:00,656 INFO L225 Difference]: With dead ends: 373 [2025-02-06 10:19:00,656 INFO L226 Difference]: Without dead ends: 373 [2025-02-06 10:19:00,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=221, Invalid=2134, Unknown=1, NotChecked=94, Total=2450 [2025-02-06 10:19:00,657 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 271 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 4894 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 5294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 4894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:00,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1255 Invalid, 5294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 4894 Invalid, 0 Unknown, 385 Unchecked, 2.8s Time] [2025-02-06 10:19:00,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-02-06 10:19:00,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 260. [2025-02-06 10:19:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 161 states have (on average 1.6521739130434783) internal successors, (266), 243 states have internal predecessors, (266), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:19:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 292 transitions. [2025-02-06 10:19:00,672 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 292 transitions. Word has length 119 [2025-02-06 10:19:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:00,673 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 292 transitions. [2025-02-06 10:19:00,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 25 states have internal predecessors, (67), 3 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-06 10:19:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 292 transitions. [2025-02-06 10:19:00,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 10:19:00,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:00,673 INFO L218 NwaCegarLoop]: trace histogram [46, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:00,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 10:19:00,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:00,875 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:19:00,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1264552857, now seen corresponding path program 1 times [2025-02-06 10:19:00,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:00,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985192108] [2025-02-06 10:19:00,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:00,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:00,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 10:19:00,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 10:19:00,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:00,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:01,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 878 proven. 96 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2025-02-06 10:19:01,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:01,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985192108] [2025-02-06 10:19:01,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985192108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:01,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824479901] [2025-02-06 10:19:01,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:01,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:01,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:01,957 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:01,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:19:02,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 10:19:02,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 10:19:02,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:02,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:02,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 10:19:02,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:02,367 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) is different from false [2025-02-06 10:19:02,370 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= .cse0 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0))))))) is different from true [2025-02-06 10:19:02,382 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from false [2025-02-06 10:19:02,384 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) is different from true [2025-02-06 10:19:02,416 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-02-06 10:19:02,463 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:19:02,463 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-02-06 10:19:02,469 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) is different from false [2025-02-06 10:19:02,471 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) is different from true [2025-02-06 10:19:02,491 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|))))) is different from false [2025-02-06 10:19:02,494 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |c_#valid| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|))))) is different from true [2025-02-06 10:19:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 746 proven. 90 refuted. 0 times theorem prover too weak. 472 trivial. 138 not checked. [2025-02-06 10:19:02,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:03,229 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 10:19:03,230 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 12 treesize of output 11 [2025-02-06 10:19:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 746 proven. 228 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2025-02-06 10:19:03,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824479901] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:03,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:03,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 19] total 32 [2025-02-06 10:19:03,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626078304] [2025-02-06 10:19:03,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:03,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 10:19:03,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:03,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 10:19:03,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=658, Unknown=9, NotChecked=280, Total=1056 [2025-02-06 10:19:03,247 INFO L87 Difference]: Start difference. First operand 260 states and 292 transitions. Second operand has 33 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 26 states have internal predecessors, (85), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-06 10:19:03,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))))) is different from false [2025-02-06 10:19:03,566 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) 1) .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= .cse1 |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse1 (select |c_#valid| .cse1))))))))) is different from true [2025-02-06 10:19:03,569 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) .cse1) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse1))) is different from false [2025-02-06 10:19:03,571 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |c_#valid|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_10| .cse0 (select |c_#valid| .cse0)))))) .cse1) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse1))) is different from true [2025-02-06 10:19:03,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse1))) is different from false [2025-02-06 10:19:03,577 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= (store |v_#valid_BEFORE_CALL_10| .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)) |v_old(#valid)_AFTER_CALL_46|)))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1)) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|) .cse1))) is different from true [2025-02-06 10:19:03,580 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|))))) .cse0)) is different from false [2025-02-06 10:19:03,582 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1))) (and (or (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (exists ((|ULTIMATE.start_l4_insert_~item~0#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) .cse0) (exists ((|v_#valid_BEFORE_CALL_10| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_10| |v_old(#valid)_AFTER_CALL_46|))) (and (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_10| |c_ULTIMATE.start_l4_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_10| .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)) |v_old(#valid)_AFTER_CALL_46|))))) .cse0)) is different from true [2025-02-06 10:19:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:04,672 INFO L93 Difference]: Finished difference Result 376 states and 433 transitions. [2025-02-06 10:19:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 10:19:04,672 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 26 states have internal predecessors, (85), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) Word has length 121 [2025-02-06 10:19:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:04,674 INFO L225 Difference]: With dead ends: 376 [2025-02-06 10:19:04,674 INFO L226 Difference]: Without dead ends: 376 [2025-02-06 10:19:04,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 225 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=175, Invalid=900, Unknown=17, NotChecked=630, Total=1722 [2025-02-06 10:19:04,675 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 706 mSDsluCounter, 3004 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 3227 SdHoareTripleChecker+Invalid, 4257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2204 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:04,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 3227 Invalid, 4257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1968 Invalid, 0 Unknown, 2204 Unchecked, 1.2s Time] [2025-02-06 10:19:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-02-06 10:19:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 270. [2025-02-06 10:19:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 169 states have (on average 1.6331360946745561) internal successors, (276), 251 states have internal predecessors, (276), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-02-06 10:19:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 306 transitions. [2025-02-06 10:19:04,682 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 306 transitions. Word has length 121 [2025-02-06 10:19:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:04,682 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 306 transitions. [2025-02-06 10:19:04,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 26 states have internal predecessors, (85), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 4 states have call successors, (10) [2025-02-06 10:19:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 306 transitions. [2025-02-06 10:19:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-06 10:19:04,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:04,683 INFO L218 NwaCegarLoop]: trace histogram [46, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:04,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:19:04,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:04,887 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:19:04,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1264552856, now seen corresponding path program 1 times [2025-02-06 10:19:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924675008] [2025-02-06 10:19:04,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:04,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 10:19:05,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 10:19:05,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:05,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 746 proven. 264 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-02-06 10:19:06,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:06,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924675008] [2025-02-06 10:19:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924675008] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:06,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171514346] [2025-02-06 10:19:06,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:06,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:06,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:06,754 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:06,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:19:06,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-06 10:19:07,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-06 10:19:07,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:07,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:07,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-02-06 10:19:07,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:07,961 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 10 treesize of output 9 [2025-02-06 10:19:09,737 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|) (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-02-06 10:19:09,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:19:09,824 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-02-06 10:19:09,839 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:19:09,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 10:19:09,941 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= (store |c_old(#length)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| (select |c_#length| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|)) |c_#length|) (= (select |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 0))) is different from true [2025-02-06 10:19:09,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:19:09,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2025-02-06 10:19:10,009 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-06 10:19:10,010 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 16 treesize of output 18 [2025-02-06 10:19:10,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 456 proven. 365 refuted. 0 times theorem prover too weak. 158 trivial. 467 not checked. [2025-02-06 10:19:10,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171514346] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:10,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:19:10,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 33] total 54 [2025-02-06 10:19:10,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717128974] [2025-02-06 10:19:10,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:10,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-06 10:19:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:10,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-06 10:19:10,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2809, Unknown=2, NotChecked=214, Total=3192 [2025-02-06 10:19:10,279 INFO L87 Difference]: Start difference. First operand 270 states and 306 transitions. Second operand has 55 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 52 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 10:19:17,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:17,399 INFO L93 Difference]: Finished difference Result 419 states and 495 transitions. [2025-02-06 10:19:17,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-06 10:19:17,399 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 52 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 121 [2025-02-06 10:19:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:17,404 INFO L225 Difference]: With dead ends: 419 [2025-02-06 10:19:17,407 INFO L226 Difference]: Without dead ends: 419 [2025-02-06 10:19:17,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1446 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=448, Invalid=5720, Unknown=2, NotChecked=310, Total=6480 [2025-02-06 10:19:17,409 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 436 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 7818 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 2475 SdHoareTripleChecker+Invalid, 8691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 7818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 825 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:17,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 2475 Invalid, 8691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 7818 Invalid, 0 Unknown, 825 Unchecked, 4.8s Time] [2025-02-06 10:19:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-02-06 10:19:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 254. [2025-02-06 10:19:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 161 states have (on average 1.6149068322981366) internal successors, (260), 237 states have internal predecessors, (260), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-02-06 10:19:17,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 286 transitions. [2025-02-06 10:19:17,419 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 286 transitions. Word has length 121 [2025-02-06 10:19:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:17,420 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 286 transitions. [2025-02-06 10:19:17,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 52 states have internal predecessors, (108), 4 states have call successors, (8), 2 states have call predecessors, (8), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-06 10:19:17,420 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 286 transitions. [2025-02-06 10:19:17,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-02-06 10:19:17,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:17,421 INFO L218 NwaCegarLoop]: trace histogram [46, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:19:17,442 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-02-06 10:19:17,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 10:19:17,625 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [l0_destroyErr0ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr1ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2ASSERT_VIOLATIONMEMORY_FREE (and 86 more)] === [2025-02-06 10:19:17,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:17,626 INFO L85 PathProgramCache]: Analyzing trace with hash -781938975, now seen corresponding path program 1 times [2025-02-06 10:19:17,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:17,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298295629] [2025-02-06 10:19:17,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:17,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:17,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 10:19:17,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 10:19:17,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:17,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 809 proven. 254 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2025-02-06 10:19:18,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298295629] [2025-02-06 10:19:18,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298295629] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:18,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505495367] [2025-02-06 10:19:18,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:18,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:18,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:18,840 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 10:19:18,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:19:19,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 10:19:19,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 10:19:19,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:19,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:19,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-06 10:19:19,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:19,302 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from false [2025-02-06 10:19:19,303 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|)))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) is different from true [2025-02-06 10:19:19,314 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|))))) is different from false [2025-02-06 10:19:19,316 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l3_insert_~item~1#1.base|))))) is different from true [2025-02-06 10:19:19,326 WARN L851 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from false [2025-02-06 10:19:19,328 WARN L873 $PredicateComparison]: unable to prove that (or (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse0 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from true [2025-02-06 10:19:19,414 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from false [2025-02-06 10:19:19,417 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) is different from true [2025-02-06 10:19:19,465 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3))))))) is different from false [2025-02-06 10:19:19,469 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse2 (select |c_#valid| .cse2))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse3) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse3 (select |c_#valid| .cse3))))))) is different from true [2025-02-06 10:19:19,501 WARN L873 $PredicateComparison]: unable to prove that (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (store |c_old(#valid)| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1) |c_#valid|)) is different from true [2025-02-06 10:19:19,539 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:19:19,540 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-02-06 10:19:19,632 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_58| .cse3)) |v_old(#valid)_AFTER_CALL_58|))))))) is different from false [2025-02-06 10:19:19,636 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_58| .cse3)) |v_old(#valid)_AFTER_CALL_58|))))))) is different from true [2025-02-06 10:19:19,757 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_58| .cse3)) |v_old(#valid)_AFTER_CALL_58|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from false [2025-02-06 10:19:19,761 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_58| .cse3)) |v_old(#valid)_AFTER_CALL_58|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1)) is different from true [2025-02-06 10:19:19,920 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_58| .cse3)) |v_old(#valid)_AFTER_CALL_58|)))) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_58| .cse4)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4)))))))) is different from false [2025-02-06 10:19:19,924 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_20| .cse3 (select |v_old(#valid)_AFTER_CALL_58| .cse3)) |v_old(#valid)_AFTER_CALL_58|)))) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse4 (select |v_old(#valid)_AFTER_CALL_58| .cse4)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4)))))))) is different from true [2025-02-06 10:19:20,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_ArrVal_3698 Int)) (= (select |c_#valid| v_ArrVal_3698) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and .cse0 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|))))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_58| .cse2)) |v_old(#valid)_AFTER_CALL_58|) (= (store |v_#valid_BEFORE_CALL_20| .cse3 (select |v_#valid_BEFORE_CALL_22| .cse3)) |v_#valid_BEFORE_CALL_22|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_58| .cse5)) |v_old(#valid)_AFTER_CALL_58|) (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse4))) is different from false [2025-02-06 10:19:20,160 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_ArrVal_3698 Int)) (= (select |c_#valid| v_ArrVal_3698) 1))) (.cse4 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and .cse0 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse1) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|))))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|)) (.cse2 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse2 (select |v_old(#valid)_AFTER_CALL_58| .cse2)) |v_old(#valid)_AFTER_CALL_58|) (= (store |v_#valid_BEFORE_CALL_20| .cse3 (select |v_#valid_BEFORE_CALL_22| .cse3)) |v_#valid_BEFORE_CALL_22|) (= (select |c_#valid| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse0 .cse4 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_58| .cse5)) |v_old(#valid)_AFTER_CALL_58|) (= (select |c_#valid| .cse5) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse4))) is different from true [2025-02-06 10:19:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 677 proven. 179 refuted. 0 times theorem prover too weak. 383 trivial. 207 not checked. [2025-02-06 10:19:20,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:19:20,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505495367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:20,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:19:20,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 32 [2025-02-06 10:19:20,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441156343] [2025-02-06 10:19:20,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:20,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-06 10:19:20,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:20,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-06 10:19:20,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=576, Unknown=19, NotChecked=570, Total=1260 [2025-02-06 10:19:20,421 INFO L87 Difference]: Start difference. First operand 254 states and 286 transitions. Second operand has 33 states, 30 states have (on average 2.6) internal successors, (78), 26 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-06 10:19:20,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|)))) .cse0))) is different from false [2025-02-06 10:19:20,707 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l2_insert_~item~2#1.base|) 1) .cse0 (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l3_insert_#t~ret9#1.base|)))) .cse0))) is different from true [2025-02-06 10:19:20,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0))) is different from false [2025-02-06 10:19:20,711 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l3_insert_~item~1#1.base|))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l3_insert_~item~1#1.base|) .cse0))) is different from true [2025-02-06 10:19:20,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) is different from false [2025-02-06 10:19:20,714 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or .cse0 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) is different from true [2025-02-06 10:19:20,730 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) .cse3 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse3 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-02-06 10:19:20,733 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse0 (select |c_#valid| .cse0))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse1 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_#t~ret6#1.base| .cse2) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse2 (select |c_#valid| .cse2)))))) .cse3 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse4 (select |c_#valid| .cse4))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|))))) (or (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_#t~ret6#1.base|) .cse3 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-02-06 10:19:20,747 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse4 (select |c_#valid| .cse4))))))))) is different from false [2025-02-06 10:19:20,750 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse0 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)) (or (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse1 (select |c_#valid| .cse1))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) .cse0 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_20| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_20| .cse3 (select |c_#valid| .cse3))) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse3 |c_ULTIMATE.start_l4_insert_~list#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_22| |c_#valid|))) (and (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse4) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_#valid_BEFORE_CALL_22| .cse4 (select |c_#valid| .cse4))))))))) is different from true [2025-02-06 10:19:20,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_20| .cse4 (select |v_old(#valid)_AFTER_CALL_58| .cse4)) |v_old(#valid)_AFTER_CALL_58|))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse3 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-02-06 10:19:20,826 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_20| .cse4 (select |v_old(#valid)_AFTER_CALL_58| .cse4)) |v_old(#valid)_AFTER_CALL_58|))))))) (or (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| |c_ULTIMATE.start_l3_insert_~list#1.base|) .cse3 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-02-06 10:19:20,856 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_20| .cse4 (select |v_old(#valid)_AFTER_CALL_58| .cse4)) |v_old(#valid)_AFTER_CALL_58|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or .cse3 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from false [2025-02-06 10:19:20,859 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (or (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))))) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse1 (select |v_old(#valid)_AFTER_CALL_58| .cse1)) |v_old(#valid)_AFTER_CALL_58|) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse1) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|))) (and (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_#valid_BEFORE_CALL_22| .cse2)) |v_#valid_BEFORE_CALL_22|) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse2 |c_ULTIMATE.start_l4_insert_~list#1.base|))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse3) (exists ((|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (and (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int))) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= .cse4 |c_ULTIMATE.start_l4_insert_~list#1.base|) (= (store |v_#valid_BEFORE_CALL_20| .cse4 (select |v_old(#valid)_AFTER_CALL_58| .cse4)) |v_old(#valid)_AFTER_CALL_58|))))))) (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (or .cse3 (= |c_ULTIMATE.start_l3_insert_~list#1.base| |c_ULTIMATE.start_l4_insert_~list#1.base|)))) is different from true [2025-02-06 10:19:20,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_20| .cse4 (select |v_old(#valid)_AFTER_CALL_58| .cse4)) |v_old(#valid)_AFTER_CALL_58|)))) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_58| .cse5)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5))))))) .cse3)) is different from false [2025-02-06 10:19:20,900 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_l4_insert_~item~0#1.base|) 1) (let ((.cse2 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|)) (.cse0 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse0 (select |v_old(#valid)_AFTER_CALL_58| .cse0)) |v_old(#valid)_AFTER_CALL_58|) (= (store |v_#valid_BEFORE_CALL_20| .cse1 (select |v_#valid_BEFORE_CALL_22| .cse1)) |v_#valid_BEFORE_CALL_22|) (= (select |c_#valid| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse0)))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse2 .cse3) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse4) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_20| .cse4 (select |v_old(#valid)_AFTER_CALL_58| .cse4)) |v_old(#valid)_AFTER_CALL_58|)))) (and .cse2 (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse5 (select |v_old(#valid)_AFTER_CALL_58| .cse5)) |v_old(#valid)_AFTER_CALL_58|) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= |c_ULTIMATE.start_l4_insert_~item~0#1.base| .cse5))))))) .cse3)) is different from true [2025-02-06 10:19:20,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((v_ArrVal_3698 Int)) (= (select |c_#valid| v_ArrVal_3698) 1))) (.cse5 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and .cse1 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_old(#valid)_AFTER_CALL_58| .cse2)) |v_old(#valid)_AFTER_CALL_58|))))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_58| .cse3)) |v_old(#valid)_AFTER_CALL_58|) (= (store |v_#valid_BEFORE_CALL_20| .cse4 (select |v_#valid_BEFORE_CALL_22| .cse4)) |v_#valid_BEFORE_CALL_22|) (= (select |c_#valid| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse5 .cse0) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_58| .cse6)) |v_old(#valid)_AFTER_CALL_58|) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse5))))) is different from false [2025-02-06 10:19:20,981 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1))) (and .cse0 (let ((.cse1 (exists ((v_ArrVal_3698 Int)) (= (select |c_#valid| v_ArrVal_3698) 1))) (.cse5 (exists ((|ULTIMATE.start_l4_insert_~list#1.base| Int)) (= (select |c_#valid| |ULTIMATE.start_l4_insert_~list#1.base|) 1)))) (or (and .cse1 (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_20| |v_old(#valid)_AFTER_CALL_58|))) (and (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse2) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1)) (= (store |v_#valid_BEFORE_CALL_20| .cse2 (select |v_old(#valid)_AFTER_CALL_58| .cse2)) |v_old(#valid)_AFTER_CALL_58|))))) (exists ((|v_#valid_BEFORE_CALL_20| (Array Int Int)) (|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_20| |v_#valid_BEFORE_CALL_22|)) (.cse3 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse3 (select |v_old(#valid)_AFTER_CALL_58| .cse3)) |v_old(#valid)_AFTER_CALL_58|) (= (store |v_#valid_BEFORE_CALL_20| .cse4 (select |v_#valid_BEFORE_CALL_22| .cse4)) |v_#valid_BEFORE_CALL_22|) (= (select |c_#valid| .cse4) 1) (= (select |v_#valid_BEFORE_CALL_20| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= (select |c_#valid| .cse3) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) (and (exists ((|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (= (select |c_#valid| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base|) 1)) .cse1 .cse5 .cse0) (and (exists ((|v_#valid_BEFORE_CALL_22| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_58| (Array Int Int)) (|zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| Int)) (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_22| |v_old(#valid)_AFTER_CALL_58|))) (and (= (store |v_#valid_BEFORE_CALL_22| .cse6 (select |v_old(#valid)_AFTER_CALL_58| .cse6)) |v_old(#valid)_AFTER_CALL_58|) (= (select |c_#valid| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_22| |c_ULTIMATE.start_l3_insert_~list#1.base|) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_58| |zalloc_or_die_#Ultimate.C_memset_#ptr#1.base| 1))))) .cse5))))) is different from true