./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2n_update_all.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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:44:16,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:44:16,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:44:16,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:44:16,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:44:16,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:44:16,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:44:16,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:44:16,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:44:16,331 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:44:16,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:44:16,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:44:16,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:44:16,332 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:44:16,332 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:44:16,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:44:16,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:44:16,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:44:16,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:44:16,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:44:16,333 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:44:16,333 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:44:16,333 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:44:16,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:44:16,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:44:16,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:44:16,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:44:16,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:44:16,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:44:16,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:44:16,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:44:16,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:44:16,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:44:16,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:44:16,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:44:16,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:44:16,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:44:16,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:44:16,336 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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2025-01-09 22:44:16,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:44:16,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:44:16,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:44:16,556 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:44:16,557 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:44:16,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all.i [2025-01-09 22:44:17,703 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee9a6ae51/efcee5293adc4d189bcb9afe9860181b/FLAG01617eacc [2025-01-09 22:44:18,022 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:44:18,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2025-01-09 22:44:18,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee9a6ae51/efcee5293adc4d189bcb9afe9860181b/FLAG01617eacc [2025-01-09 22:44:18,286 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee9a6ae51/efcee5293adc4d189bcb9afe9860181b [2025-01-09 22:44:18,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:44:18,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:44:18,291 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:44:18,291 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:44:18,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:44:18,295 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f0ceb9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18, skipping insertion in model container [2025-01-09 22:44:18,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:44:18,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:44:18,507 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:44:18,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:44:18,552 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:44:18,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18 WrapperNode [2025-01-09 22:44:18,554 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:44:18,555 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:44:18,555 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:44:18,555 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:44:18,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,585 INFO L138 Inliner]: procedures = 126, calls = 23, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 109 [2025-01-09 22:44:18,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:44:18,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:44:18,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:44:18,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:44:18,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,610 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-09 22:44:18,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:44:18,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:44:18,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:44:18,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:44:18,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (1/1) ... [2025-01-09 22:44:18,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:44:18,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:18,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:44:18,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:44:18,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 22:44:18,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 22:44:18,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:44:18,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:44:18,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:44:18,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:44:18,769 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:44:18,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:44:18,995 INFO L? ?]: Removed 81 outVars from TransFormulas that were not future-live. [2025-01-09 22:44:18,995 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:44:19,003 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:44:19,003 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 22:44:19,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:44:19 BoogieIcfgContainer [2025-01-09 22:44:19,005 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:44:19,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:44:19,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:44:19,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:44:19,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:44:18" (1/3) ... [2025-01-09 22:44:19,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f855ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:44:19, skipping insertion in model container [2025-01-09 22:44:19,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:44:18" (2/3) ... [2025-01-09 22:44:19,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f855ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:44:19, skipping insertion in model container [2025-01-09 22:44:19,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:44:19" (3/3) ... [2025-01-09 22:44:19,017 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2025-01-09 22:44:19,028 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:44:19,030 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_update_all.i that has 1 procedures, 61 locations, 1 initial locations, 6 loop locations, and 21 error locations. [2025-01-09 22:44:19,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:44:19,072 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;@17e4a3e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:44:19,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-09 22:44:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:44:19,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:19,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:44:19,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:19,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:19,086 INFO L85 PathProgramCache]: Analyzing trace with hash 28694887, now seen corresponding path program 1 times [2025-01-09 22:44:19,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:19,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766264779] [2025-01-09 22:44:19,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:19,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:44:19,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:44:19,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:19,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:19,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:19,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766264779] [2025-01-09 22:44:19,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766264779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:19,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:19,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:44:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850443205] [2025-01-09 22:44:19,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:19,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:44:19,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:19,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:44:19,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:19,345 INFO L87 Difference]: Start difference. First operand has 61 states, 39 states have (on average 1.7692307692307692) internal successors, (69), 60 states have internal predecessors, (69), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:19,394 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2025-01-09 22:44:19,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:44:19,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:44:19,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:19,400 INFO L225 Difference]: With dead ends: 58 [2025-01-09 22:44:19,401 INFO L226 Difference]: Without dead ends: 55 [2025-01-09 22:44:19,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:19,405 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:19,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:19,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-09 22:44:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-09 22:44:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 54 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2025-01-09 22:44:19,426 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 5 [2025-01-09 22:44:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:19,427 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2025-01-09 22:44:19,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2025-01-09 22:44:19,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:44:19,427 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:19,427 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:44:19,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:44:19,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:19,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:19,428 INFO L85 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2025-01-09 22:44:19,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:19,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159353126] [2025-01-09 22:44:19,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:19,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:19,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:44:19,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:44:19,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:19,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:19,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:19,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159353126] [2025-01-09 22:44:19,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159353126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:19,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:19,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:44:19,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521402764] [2025-01-09 22:44:19,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:19,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:44:19,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:19,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:44:19,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:19,475 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:19,503 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-01-09 22:44:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:44:19,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-01-09 22:44:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:19,504 INFO L225 Difference]: With dead ends: 53 [2025-01-09 22:44:19,504 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 22:44:19,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:19,505 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:19,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 22:44:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 22:44:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-01-09 22:44:19,508 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 5 [2025-01-09 22:44:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:19,508 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-01-09 22:44:19,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-01-09 22:44:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 22:44:19,508 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:19,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:19,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:44:19,509 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:19,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:19,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1826854847, now seen corresponding path program 1 times [2025-01-09 22:44:19,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:19,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303791776] [2025-01-09 22:44:19,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:19,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:19,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 22:44:19,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 22:44:19,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:19,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:19,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303791776] [2025-01-09 22:44:19,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303791776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:19,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:19,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:44:19,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112971937] [2025-01-09 22:44:19,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:44:19,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:19,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:44:19,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:19,537 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:19,545 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2025-01-09 22:44:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:44:19,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-01-09 22:44:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:19,546 INFO L225 Difference]: With dead ends: 63 [2025-01-09 22:44:19,546 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 22:44:19,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:44:19,547 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:19,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 22:44:19,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2025-01-09 22:44:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 53 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-01-09 22:44:19,555 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 7 [2025-01-09 22:44:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:19,555 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-01-09 22:44:19,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-01-09 22:44:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:44:19,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:19,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:19,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:44:19,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:19,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 381200138, now seen corresponding path program 1 times [2025-01-09 22:44:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:19,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952762194] [2025-01-09 22:44:19,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:19,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:44:19,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:44:19,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:19,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:19,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:19,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952762194] [2025-01-09 22:44:19,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952762194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:19,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:19,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:44:19,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734357454] [2025-01-09 22:44:19,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:19,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:44:19,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:19,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:44:19,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:19,654 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:19,779 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2025-01-09 22:44:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:19,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:44:19,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:19,784 INFO L225 Difference]: With dead ends: 53 [2025-01-09 22:44:19,784 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 22:44:19,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:19,784 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:19,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 147 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:19,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 22:44:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-01-09 22:44:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.5675675675675675) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-01-09 22:44:19,794 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 9 [2025-01-09 22:44:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:19,795 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-01-09 22:44:19,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-01-09 22:44:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:44:19,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:19,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:19,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:44:19,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:19,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash 381200139, now seen corresponding path program 1 times [2025-01-09 22:44:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:19,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117471825] [2025-01-09 22:44:19,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:19,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:44:19,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:44:19,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:19,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:19,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:19,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117471825] [2025-01-09 22:44:19,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117471825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:19,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:19,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:44:19,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126594274] [2025-01-09 22:44:19,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:19,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:44:19,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:19,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:44:19,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:19,912 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:19,953 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-01-09 22:44:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:19,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:44:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:19,954 INFO L225 Difference]: With dead ends: 52 [2025-01-09 22:44:19,954 INFO L226 Difference]: Without dead ends: 52 [2025-01-09 22:44:19,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:19,955 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:19,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 158 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-09 22:44:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-09 22:44:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-01-09 22:44:19,961 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 9 [2025-01-09 22:44:19,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:19,961 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-01-09 22:44:19,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:19,961 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-01-09 22:44:19,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:44:19,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:19,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:19,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:44:19,962 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:19,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1735276049, now seen corresponding path program 1 times [2025-01-09 22:44:19,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:19,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217811552] [2025-01-09 22:44:19,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:19,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:44:19,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:44:19,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:19,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:20,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217811552] [2025-01-09 22:44:20,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217811552] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:20,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004865933] [2025-01-09 22:44:20,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:20,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:20,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:20,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:20,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:44:20,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:44:20,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:44:20,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:20,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:20,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:44:20,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:20,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:20,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004865933] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:20,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:20,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 22:44:20,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647540997] [2025-01-09 22:44:20,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:20,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:44:20,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:20,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:44:20,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:20,215 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:20,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:20,224 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2025-01-09 22:44:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:44:20,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-01-09 22:44:20,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:20,225 INFO L225 Difference]: With dead ends: 60 [2025-01-09 22:44:20,225 INFO L226 Difference]: Without dead ends: 60 [2025-01-09 22:44:20,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:20,226 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:20,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 105 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-01-09 22:44:20,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-01-09 22:44:20,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-01-09 22:44:20,229 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 15 [2025-01-09 22:44:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:20,229 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-01-09 22:44:20,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-01-09 22:44:20,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:44:20,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:20,229 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:20,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:20,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:20,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:20,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash -228171165, now seen corresponding path program 2 times [2025-01-09 22:44:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:20,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600051167] [2025-01-09 22:44:20,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:20,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:20,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-01-09 22:44:20,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 23 statements. [2025-01-09 22:44:20,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 22:44:20,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:20,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:20,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600051167] [2025-01-09 22:44:20,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600051167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:20,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:20,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:44:20,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544295376] [2025-01-09 22:44:20,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:20,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:44:20,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:20,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:44:20,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:44:20,477 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:20,507 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2025-01-09 22:44:20,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:44:20,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 22:44:20,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:20,508 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:44:20,508 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:44:20,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:20,509 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 21 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:20,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 144 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:44:20,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 62. [2025-01-09 22:44:20,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2025-01-09 22:44:20,512 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 23 [2025-01-09 22:44:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:20,512 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2025-01-09 22:44:20,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2025-01-09 22:44:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:44:20,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:20,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:20,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:44:20,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:20,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash -228170973, now seen corresponding path program 1 times [2025-01-09 22:44:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58516808] [2025-01-09 22:44:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:20,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:20,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:44:20,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:44:20,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:20,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:44:20,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58516808] [2025-01-09 22:44:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58516808] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:20,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:44:20,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085792694] [2025-01-09 22:44:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:20,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:44:20,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:20,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:44:20,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:44:20,651 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:20,803 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2025-01-09 22:44:20,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:44:20,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-01-09 22:44:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:20,804 INFO L225 Difference]: With dead ends: 65 [2025-01-09 22:44:20,804 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 22:44:20,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:44:20,804 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:20,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 197 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 22:44:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 22:44:20,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.48) internal successors, (74), 64 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-01-09 22:44:20,807 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 23 [2025-01-09 22:44:20,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:20,807 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-01-09 22:44:20,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-01-09 22:44:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:44:20,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:20,808 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:20,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:44:20,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:20,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash -228170972, now seen corresponding path program 1 times [2025-01-09 22:44:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:20,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875934197] [2025-01-09 22:44:20,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:20,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:20,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:44:20,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:44:20,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:20,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:21,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:21,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875934197] [2025-01-09 22:44:21,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875934197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:21,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:21,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:44:21,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299741317] [2025-01-09 22:44:21,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:21,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:44:21,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:21,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:44:21,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:44:21,172 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:21,324 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2025-01-09 22:44:21,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:44:21,325 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 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 23 [2025-01-09 22:44:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:21,328 INFO L225 Difference]: With dead ends: 65 [2025-01-09 22:44:21,329 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 22:44:21,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:44:21,329 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 39 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:21,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 233 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:21,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 22:44:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 22:44:21,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.44) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2025-01-09 22:44:21,332 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 23 [2025-01-09 22:44:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:21,332 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2025-01-09 22:44:21,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2025-01-09 22:44:21,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:44:21,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:21,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:21,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:44:21,337 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:21,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152103, now seen corresponding path program 1 times [2025-01-09 22:44:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-01-09 22:44:21,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:21,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:44:21,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:44:21,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:21,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:44:21,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:21,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-01-09 22:44:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36089725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:21,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:21,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:44:21,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352661007] [2025-01-09 22:44:21,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:21,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:44:21,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:21,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:44:21,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:44:21,444 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:21,594 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2025-01-09 22:44:21,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:44:21,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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 24 [2025-01-09 22:44:21,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:21,595 INFO L225 Difference]: With dead ends: 68 [2025-01-09 22:44:21,595 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 22:44:21,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:44:21,596 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 41 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:21,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 197 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 22:44:21,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-01-09 22:44:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.471698113207547) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-01-09 22:44:21,599 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 24 [2025-01-09 22:44:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:21,599 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-01-09 22:44:21,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-01-09 22:44:21,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:44:21,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:21,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:21,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:44:21,600 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:21,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:21,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1517152104, now seen corresponding path program 1 times [2025-01-09 22:44:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:21,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78881628] [2025-01-09 22:44:21,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:21,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:21,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:44:21,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:44:21,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:21,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:21,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:21,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78881628] [2025-01-09 22:44:21,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78881628] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:21,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781487548] [2025-01-09 22:44:21,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:21,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:21,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:21,693 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:21,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:44:21,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 22:44:21,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:44:21,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:21,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:21,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 22:44:21,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:21,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:44:21,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781487548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:21,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:44:21,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-01-09 22:44:21,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7802703] [2025-01-09 22:44:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:21,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:44:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:21,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:44:21,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:21,825 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:21,836 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-01-09 22:44:21,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:44:21,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 24 [2025-01-09 22:44:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:21,837 INFO L225 Difference]: With dead ends: 89 [2025-01-09 22:44:21,837 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 22:44:21,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:21,838 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:21,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 113 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 22:44:21,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 69. [2025-01-09 22:44:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2025-01-09 22:44:21,840 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 24 [2025-01-09 22:44:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:21,840 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2025-01-09 22:44:21,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2025-01-09 22:44:21,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:44:21,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:21,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:21,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:44:22,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:22,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:22,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash -907098282, now seen corresponding path program 1 times [2025-01-09 22:44:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:22,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416137704] [2025-01-09 22:44:22,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:22,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:44:22,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:44:22,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:22,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:22,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416137704] [2025-01-09 22:44:22,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416137704] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:22,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702973537] [2025-01-09 22:44:22,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:22,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:22,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:22,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:22,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:44:22,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:44:22,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:44:22,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:22,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:22,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 22:44:22,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:22,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:22,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:22,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702973537] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:22,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:22,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-01-09 22:44:22,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875062965] [2025-01-09 22:44:22,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:22,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:44:22,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:22,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:44:22,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:44:22,398 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:22,444 INFO L93 Difference]: Finished difference Result 121 states and 140 transitions. [2025-01-09 22:44:22,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:44:22,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 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 28 [2025-01-09 22:44:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:22,445 INFO L225 Difference]: With dead ends: 121 [2025-01-09 22:44:22,445 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 22:44:22,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:22,446 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 128 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:22,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 224 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 22:44:22,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 83. [2025-01-09 22:44:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 82 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 101 transitions. [2025-01-09 22:44:22,449 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 101 transitions. Word has length 28 [2025-01-09 22:44:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:22,449 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 101 transitions. [2025-01-09 22:44:22,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 101 transitions. [2025-01-09 22:44:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:44:22,450 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:22,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:22,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:44:22,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:22,651 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:22,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:22,651 INFO L85 PathProgramCache]: Analyzing trace with hash -346281672, now seen corresponding path program 1 times [2025-01-09 22:44:22,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:22,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-01-09 22:44:22,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:22,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:22,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:44:22,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:44:22,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:22,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:22,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438046205] [2025-01-09 22:44:22,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438046205] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:22,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446556976] [2025-01-09 22:44:22,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:22,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:22,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:22,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:22,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:44:22,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:44:22,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:44:22,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:22,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:22,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:44:22,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:22,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:22,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446556976] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:22,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:22,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-01-09 22:44:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904731264] [2025-01-09 22:44:22,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:22,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:44:22,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:22,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:44:22,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:44:22,904 INFO L87 Difference]: Start difference. First operand 83 states and 101 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:22,945 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2025-01-09 22:44:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:44:22,945 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 22:44:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:22,946 INFO L225 Difference]: With dead ends: 118 [2025-01-09 22:44:22,946 INFO L226 Difference]: Without dead ends: 118 [2025-01-09 22:44:22,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:22,946 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 40 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:22,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 259 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:22,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-01-09 22:44:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 87. [2025-01-09 22:44:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 86 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 106 transitions. [2025-01-09 22:44:22,949 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 106 transitions. Word has length 30 [2025-01-09 22:44:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:22,949 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 106 transitions. [2025-01-09 22:44:22,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2025-01-09 22:44:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:44:22,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:22,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:22,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:23,150 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,SelfDestructingSolverStorable12 [2025-01-09 22:44:23,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:23,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:23,151 INFO L85 PathProgramCache]: Analyzing trace with hash -346281480, now seen corresponding path program 1 times [2025-01-09 22:44:23,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:23,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706416062] [2025-01-09 22:44:23,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:23,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:23,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:44:23,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:44:23,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:23,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706416062] [2025-01-09 22:44:23,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706416062] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:23,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696342524] [2025-01-09 22:44:23,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:23,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:23,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:23,627 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:23,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:44:23,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:44:23,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:44:23,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:23,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:23,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 22:44:23,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:23,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:44:23,779 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:44:23,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-01-09 22:44:23,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:23,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:23,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2025-01-09 22:44:24,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 22:44:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:24,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:24,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696342524] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:24,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:24,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 36 [2025-01-09 22:44:24,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583714935] [2025-01-09 22:44:24,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:24,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 22:44:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:24,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 22:44:24,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1202, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 22:44:24,327 INFO L87 Difference]: Start difference. First operand 87 states and 106 transitions. Second operand has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:24,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:24,891 INFO L93 Difference]: Finished difference Result 137 states and 176 transitions. [2025-01-09 22:44:24,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:44:24,892 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 22:44:24,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:24,893 INFO L225 Difference]: With dead ends: 137 [2025-01-09 22:44:24,893 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 22:44:24,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=250, Invalid=2006, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:44:24,894 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 77 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:24,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 561 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:44:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 22:44:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 96. [2025-01-09 22:44:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 95 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2025-01-09 22:44:24,897 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 30 [2025-01-09 22:44:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:24,897 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2025-01-09 22:44:24,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2025-01-09 22:44:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:44:24,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:24,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:24,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:25,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 22:44:25,102 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:25,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -346281479, now seen corresponding path program 1 times [2025-01-09 22:44:25,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:25,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387840305] [2025-01-09 22:44:25,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:25,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:25,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:44:25,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:44:25,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:25,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:25,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:25,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387840305] [2025-01-09 22:44:25,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387840305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:25,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644042261] [2025-01-09 22:44:25,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:25,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:25,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:25,836 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:25,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:44:25,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:44:25,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:44:25,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:25,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:25,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-09 22:44:25,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:26,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:44:26,054 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-01-09 22:44:26,058 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-01-09 22:44:26,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:26,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:26,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:26,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2025-01-09 22:44:26,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:26,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2025-01-09 22:44:26,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-01-09 22:44:26,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-01-09 22:44:26,551 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:26,551 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:26,716 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_690 (Array Int Int))) (or (forall ((v_ArrVal_689 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_690) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_689)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (not (= v_ArrVal_690 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_690 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_690 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_690) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) 1)) (not (= v_ArrVal_690 (store .cse1 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_690 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))))) is different from false [2025-01-09 22:44:27,098 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 49 treesize of output 45 [2025-01-09 22:44:27,114 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-01-09 22:44:27,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-01-09 22:44:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2025-01-09 22:44:27,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644042261] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:27,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:27,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 44 [2025-01-09 22:44:27,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141713258] [2025-01-09 22:44:27,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:27,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-01-09 22:44:27,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:27,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-01-09 22:44:27,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1764, Unknown=1, NotChecked=84, Total=1980 [2025-01-09 22:44:27,195 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 45 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:28,220 INFO L93 Difference]: Finished difference Result 150 states and 192 transitions. [2025-01-09 22:44:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:44:28,220 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 45 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-01-09 22:44:28,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:28,221 INFO L225 Difference]: With dead ends: 150 [2025-01-09 22:44:28,221 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 22:44:28,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=269, Invalid=2926, Unknown=1, NotChecked=110, Total=3306 [2025-01-09 22:44:28,222 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 88 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:28,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 881 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1160 Invalid, 0 Unknown, 83 Unchecked, 0.5s Time] [2025-01-09 22:44:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 22:44:28,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 103. [2025-01-09 22:44:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 102 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 130 transitions. [2025-01-09 22:44:28,225 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 130 transitions. Word has length 30 [2025-01-09 22:44:28,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:28,225 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 130 transitions. [2025-01-09 22:44:28,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.8181818181818181) internal successors, (80), 45 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,225 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2025-01-09 22:44:28,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:44:28,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:28,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:28,232 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-01-09 22:44:28,430 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,SelfDestructingSolverStorable14 [2025-01-09 22:44:28,430 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:28,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash -855506876, now seen corresponding path program 2 times [2025-01-09 22:44:28,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:28,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137216524] [2025-01-09 22:44:28,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:28,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-09 22:44:28,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:44:28,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:44:28,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:44:28,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:28,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137216524] [2025-01-09 22:44:28,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137216524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:28,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:28,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:44:28,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751560620] [2025-01-09 22:44:28,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:28,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:44:28,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:28,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:44:28,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:28,674 INFO L87 Difference]: Start difference. First operand 103 states and 130 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:28,895 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2025-01-09 22:44:28,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:44:28,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-09 22:44:28,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:28,895 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:44:28,895 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:44:28,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:44:28,896 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 35 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:28,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 268 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:44:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:44:28,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 22:44:28,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 102 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2025-01-09 22:44:28,898 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 32 [2025-01-09 22:44:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:28,898 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2025-01-09 22:44:28,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2025-01-09 22:44:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:44:28,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:28,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:28,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:44:28,899 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:28,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:28,900 INFO L85 PathProgramCache]: Analyzing trace with hash -75125281, now seen corresponding path program 1 times [2025-01-09 22:44:28,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:28,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783070649] [2025-01-09 22:44:28,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:28,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:28,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 22:44:28,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:44:28,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:28,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:28,951 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-09 22:44:28,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:28,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783070649] [2025-01-09 22:44:28,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783070649] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:28,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:44:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884630139] [2025-01-09 22:44:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:28,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:44:28,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:28,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:44:28,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:44:28,953 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:28,970 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2025-01-09 22:44:28,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:44:28,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 35 [2025-01-09 22:44:28,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:28,971 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:44:28,971 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:44:28,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:44:28,972 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:28,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:44:28,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-01-09 22:44:28,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 97 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 115 transitions. [2025-01-09 22:44:28,974 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 115 transitions. Word has length 35 [2025-01-09 22:44:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:28,974 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 115 transitions. [2025-01-09 22:44:28,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:28,974 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 115 transitions. [2025-01-09 22:44:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:44:28,977 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:28,977 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-01-09 22:44:28,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:44:28,978 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:28,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:28,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2077620419, now seen corresponding path program 2 times [2025-01-09 22:44:28,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:28,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059137269] [2025-01-09 22:44:28,978 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:28,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:28,989 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 22:44:28,995 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:44:28,995 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:44:28,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 22:44:29,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059137269] [2025-01-09 22:44:29,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059137269] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:29,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126878434] [2025-01-09 22:44:29,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:44:29,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:29,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:29,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:29,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:44:29,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 22:44:29,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:44:29,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:44:29,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:29,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:44:29,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 22:44:29,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:44:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126878434] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:29,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:44:29,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-01-09 22:44:29,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133951632] [2025-01-09 22:44:29,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:29,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:44:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:29,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:44:29,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:29,277 INFO L87 Difference]: Start difference. First operand 98 states and 115 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:29,296 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2025-01-09 22:44:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:44:29,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:44:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:29,297 INFO L225 Difference]: With dead ends: 79 [2025-01-09 22:44:29,297 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 22:44:29,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:29,298 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 50 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:29,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 129 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 22:44:29,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2025-01-09 22:44:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-01-09 22:44:29,299 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 37 [2025-01-09 22:44:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:29,299 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-01-09 22:44:29,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:29,299 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-01-09 22:44:29,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:44:29,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:29,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:29,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:44:29,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:29,505 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:29,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:29,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1599648099, now seen corresponding path program 1 times [2025-01-09 22:44:29,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:29,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015992002] [2025-01-09 22:44:29,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:29,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:29,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:44:29,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:44:29,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:29,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:29,595 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:29,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:29,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015992002] [2025-01-09 22:44:29,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015992002] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:29,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532596283] [2025-01-09 22:44:29,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:29,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:29,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:29,600 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:29,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:44:29,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:44:29,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:44:29,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:29,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:29,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:44:29,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:29,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:44:29,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532596283] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:29,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:29,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-09 22:44:29,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326257952] [2025-01-09 22:44:29,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:29,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:44:29,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:29,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:44:29,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:29,760 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:29,787 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2025-01-09 22:44:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 38 [2025-01-09 22:44:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:29,787 INFO L225 Difference]: With dead ends: 76 [2025-01-09 22:44:29,787 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 22:44:29,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:44:29,788 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 33 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:29,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 205 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 22:44:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-01-09 22:44:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2025-01-09 22:44:29,790 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 38 [2025-01-09 22:44:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:29,790 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2025-01-09 22:44:29,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:29,790 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2025-01-09 22:44:29,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:44:29,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:29,791 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:29,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:44:29,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:29,995 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:29,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:29,995 INFO L85 PathProgramCache]: Analyzing trace with hash 91492922, now seen corresponding path program 1 times [2025-01-09 22:44:29,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:29,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921956617] [2025-01-09 22:44:29,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:30,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:44:30,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:44:30,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:30,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:30,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:30,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921956617] [2025-01-09 22:44:30,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921956617] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:30,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554719151] [2025-01-09 22:44:30,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:30,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:30,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:30,712 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:30,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:44:30,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:44:30,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:44:30,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:30,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:30,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 22:44:30,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:30,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:44:30,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:44:30,969 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-01-09 22:44:31,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:31,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 22:44:31,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:44:31,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2025-01-09 22:44:31,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:44:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:31,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:31,744 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-01-09 22:44:31,748 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1113) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-01-09 22:44:31,756 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1113 (Array Int Int))) (= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1113) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-01-09 22:44:31,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:31,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2025-01-09 22:44:31,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:31,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2025-01-09 22:44:31,787 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 23 treesize of output 21 [2025-01-09 22:44:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-01-09 22:44:32,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554719151] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:32,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:32,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 66 [2025-01-09 22:44:32,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060929562] [2025-01-09 22:44:32,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:32,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-01-09 22:44:32,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:32,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-01-09 22:44:32,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3680, Unknown=25, NotChecked=372, Total=4290 [2025-01-09 22:44:32,207 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:33,594 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2025-01-09 22:44:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 22:44:33,595 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-09 22:44:33,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:33,595 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:44:33,595 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:44:33,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=481, Invalid=6476, Unknown=27, NotChecked=498, Total=7482 [2025-01-09 22:44:33,597 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 102 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:33,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 1259 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1707 Invalid, 0 Unknown, 182 Unchecked, 0.7s Time] [2025-01-09 22:44:33,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:44:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-01-09 22:44:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:33,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2025-01-09 22:44:33,599 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 41 [2025-01-09 22:44:33,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:33,599 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2025-01-09 22:44:33,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 66 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2025-01-09 22:44:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:44:33,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:33,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:33,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:44:33,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:33,804 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:33,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:33,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1136522892, now seen corresponding path program 1 times [2025-01-09 22:44:33,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:33,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543253786] [2025-01-09 22:44:33,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:33,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:33,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:44:33,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:44:33,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:33,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:34,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543253786] [2025-01-09 22:44:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543253786] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:34,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102918581] [2025-01-09 22:44:34,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:34,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:34,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:34,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:34,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:44:34,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:44:34,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:44:34,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:34,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:34,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-01-09 22:44:34,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:34,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:44:34,929 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:44:34,929 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-01-09 22:44:35,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:35,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:35,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 22:44:35,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:44:35,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-01-09 22:44:35,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:44:35,411 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:44:35,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:35,492 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-01-09 22:44:35,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 22:44:35,556 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2025-01-09 22:44:35,559 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2025-01-09 22:44:35,565 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1222 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))))) is different from false [2025-01-09 22:44:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 13 refuted. 2 times theorem prover too weak. 1 trivial. 5 not checked. [2025-01-09 22:44:39,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102918581] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:39,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:39,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 21] total 55 [2025-01-09 22:44:39,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902886044] [2025-01-09 22:44:39,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:39,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-01-09 22:44:39,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:39,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-01-09 22:44:39,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2592, Unknown=33, NotChecked=312, Total=3080 [2025-01-09 22:44:39,904 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 56 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 56 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:41,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:41,605 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2025-01-09 22:44:41,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 22:44:41,606 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 56 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 22:44:41,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:41,606 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:44:41,606 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:44:41,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=422, Invalid=5719, Unknown=33, NotChecked=468, Total=6642 [2025-01-09 22:44:41,608 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 196 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:41,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 991 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1721 Invalid, 0 Unknown, 215 Unchecked, 0.8s Time] [2025-01-09 22:44:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:44:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2025-01-09 22:44:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-01-09 22:44:41,610 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 44 [2025-01-09 22:44:41,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:41,610 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-01-09 22:44:41,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 56 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-01-09 22:44:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:44:41,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:41,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:41,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:41,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:41,815 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:41,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:41,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1136522891, now seen corresponding path program 1 times [2025-01-09 22:44:41,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:41,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111310629] [2025-01-09 22:44:41,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:41,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:41,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:44:41,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:44:41,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:41,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:42,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:42,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111310629] [2025-01-09 22:44:42,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111310629] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:42,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993131985] [2025-01-09 22:44:42,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:42,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:42,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:42,932 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:42,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:44:43,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:44:43,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:44:43,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:43,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:43,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-01-09 22:44:43,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:43,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:44:43,197 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:44:43,197 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-01-09 22:44:43,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:43,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:43,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:43,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 22:44:43,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:43,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:44:43,696 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:44:43,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2025-01-09 22:44:43,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-09 22:44:43,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-01-09 22:44:43,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-01-09 22:44:43,941 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:44:43,941 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:44,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:44,086 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 46 treesize of output 50 [2025-01-09 22:44:44,108 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1))) (forall ((v_ArrVal_1333 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1333) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2025-01-09 22:44:44,124 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1333 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1333) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (+ |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset| 1))) (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))))) is different from false [2025-01-09 22:44:44,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1333 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1333) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1)))))) is different from false [2025-01-09 22:44:44,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1332 Int) (v_ArrVal_1333 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1332)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1333) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (forall ((v_ArrVal_1330 (Array Int Int))) (or (forall ((v_ArrVal_1332 Int) (v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1330) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1332)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (not (= v_ArrVal_1330 (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1330 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))))) (forall ((v_ArrVal_1330 (Array Int Int))) (or (not (= v_ArrVal_1330 (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1330 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_1332 Int) (v_prenex_2 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1330))) (< (select (select (store .cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1332)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (+ (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 1)))))))) is different from false [2025-01-09 22:44:44,356 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select .cse3 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1330 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1330 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1330)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1330) .cse1 v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) (+ (select v_ArrVal_1330 .cse2) 1))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1332 Int) (v_ArrVal_1333 (Array Int Int))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1332)) .cse1 v_ArrVal_1333) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1330 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1330 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1330)) (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1330) .cse1 v_ArrVal_1334) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))))) is different from false [2025-01-09 22:44:44,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1332 Int) (v_ArrVal_1333 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1332)) .cse1 v_ArrVal_1333) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1330 (Array Int Int))) (or (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1330) .cse1 v_ArrVal_1334) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1330 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1330)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1330 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1330) .cse1 v_prenex_2) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) (+ (select v_ArrVal_1330 .cse2) 1))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1330 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1330))))))))) is different from false [2025-01-09 22:44:44,459 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse1 (select .cse0 .cse2)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1332 Int) (v_ArrVal_1333 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1332)) .cse1 v_ArrVal_1333) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) .cse1)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1330 (Array Int Int))) (or (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1330) .cse1 v_ArrVal_1334) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1330 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1330)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|) (forall ((v_ArrVal_1330 (Array Int Int))) (or (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1330) .cse1 v_prenex_2) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) (+ (select v_ArrVal_1330 .cse2) 1))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1330 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1330))))))))) is different from false [2025-01-09 22:44:44,506 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse1 (select .cse0 .cse2))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1332 Int) (v_ArrVal_1333 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| v_ArrVal_1332)) .cse1 v_ArrVal_1333) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1330 (Array Int Int))) (or (forall ((v_ArrVal_1334 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1330) .cse1 v_ArrVal_1334) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1330 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1330)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_53| Int)) (or (forall ((v_ArrVal_1330 (Array Int Int))) (or (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53| (select v_ArrVal_1330 |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)) v_ArrVal_1330)) (forall ((v_prenex_2 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1330) .cse1 v_prenex_2) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) (+ (select v_ArrVal_1330 .cse2) 1))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_53|)))))) is different from false [2025-01-09 22:44:44,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-01-09 22:44:44,526 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:44,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:44,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-01-09 22:44:44,539 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 22 treesize of output 14 [2025-01-09 22:44:44,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-01-09 22:44:44,548 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:44,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-01-09 22:44:44,557 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:44,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:44,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-01-09 22:44:44,561 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 18 treesize of output 10 [2025-01-09 22:44:44,568 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:44,570 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:44:44,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2025-01-09 22:44:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2025-01-09 22:44:44,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993131985] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:44,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:44,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 21] total 62 [2025-01-09 22:44:44,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38837154] [2025-01-09 22:44:44,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:44,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-01-09 22:44:44,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:44,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-01-09 22:44:44,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2812, Unknown=30, NotChecked=904, Total=3906 [2025-01-09 22:44:44,846 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 63 states, 62 states have (on average 1.935483870967742) internal successors, (120), 63 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:46,974 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2025-01-09 22:44:46,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 22:44:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 1.935483870967742) internal successors, (120), 63 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 22:44:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:46,977 INFO L225 Difference]: With dead ends: 82 [2025-01-09 22:44:46,977 INFO L226 Difference]: Without dead ends: 82 [2025-01-09 22:44:46,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=445, Invalid=6037, Unknown=30, NotChecked=1320, Total=7832 [2025-01-09 22:44:46,983 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 312 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 572 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:46,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1256 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1785 Invalid, 0 Unknown, 572 Unchecked, 0.9s Time] [2025-01-09 22:44:46,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-01-09 22:44:46,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2025-01-09 22:44:46,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.25) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-01-09 22:44:46,985 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 44 [2025-01-09 22:44:46,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:46,985 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-01-09 22:44:46,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 1.935483870967742) internal successors, (120), 63 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:46,985 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-01-09 22:44:46,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:44:46,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:46,985 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:46,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:47,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 22:44:47,186 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:47,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:47,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1136523083, now seen corresponding path program 1 times [2025-01-09 22:44:47,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:47,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398811763] [2025-01-09 22:44:47,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:47,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:47,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:44:47,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:44:47,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:47,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:44:47,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:47,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398811763] [2025-01-09 22:44:47,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398811763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:47,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164107136] [2025-01-09 22:44:47,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:47,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:47,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:47,284 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:47,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:44:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:44:47,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:44:47,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:47,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:47,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 22:44:47,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:44:47,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:47,473 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:44:47,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164107136] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:47,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:47,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2025-01-09 22:44:47,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48197261] [2025-01-09 22:44:47,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:47,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:44:47,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:47,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:44:47,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:44:47,474 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:47,510 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2025-01-09 22:44:47,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:44:47,510 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 44 [2025-01-09 22:44:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:47,511 INFO L225 Difference]: With dead ends: 66 [2025-01-09 22:44:47,511 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 22:44:47,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:44:47,511 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 24 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:47,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 142 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 22:44:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 22:44:47,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.152542372881356) internal successors, (68), 65 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2025-01-09 22:44:47,513 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 44 [2025-01-09 22:44:47,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:47,513 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2025-01-09 22:44:47,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:47,514 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2025-01-09 22:44:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:44:47,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:47,514 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:47,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:47,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:47,714 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:47,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2146644248, now seen corresponding path program 1 times [2025-01-09 22:44:47,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:47,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707027888] [2025-01-09 22:44:47,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:47,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:47,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:44:47,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:44:47,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:47,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:44:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:47,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707027888] [2025-01-09 22:44:47,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707027888] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:47,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951566321] [2025-01-09 22:44:47,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:47,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:47,774 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:47,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:44:47,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:44:47,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:44:47,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:47,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:47,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 22:44:47,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:47,960 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:44:47,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 22:44:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951566321] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:47,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:47,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-01-09 22:44:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749649798] [2025-01-09 22:44:47,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:47,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:44:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:47,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:44:47,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:44:47,985 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:48,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:48,009 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2025-01-09 22:44:48,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:44:48,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 47 [2025-01-09 22:44:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:48,010 INFO L225 Difference]: With dead ends: 66 [2025-01-09 22:44:48,010 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 22:44:48,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:44:48,011 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 39 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:48,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 131 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:44:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 22:44:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 22:44:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 65 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2025-01-09 22:44:48,013 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 47 [2025-01-09 22:44:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:48,013 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2025-01-09 22:44:48,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2025-01-09 22:44:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:44:48,013 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:48,013 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:48,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:48,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:48,216 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:48,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1477308174, now seen corresponding path program 1 times [2025-01-09 22:44:48,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:48,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180250949] [2025-01-09 22:44:48,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:48,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:48,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:44:48,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:44:48,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:48,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180250949] [2025-01-09 22:44:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180250949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:49,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066022708] [2025-01-09 22:44:49,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:49,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:49,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:49,142 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:49,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:44:49,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:44:49,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:44:49,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:49,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:49,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-01-09 22:44:49,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:49,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:44:49,496 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-01-09 22:44:49,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:49,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:44:49,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:49,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 22:44:49,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:49,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-01-09 22:44:50,176 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:44:50,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 73 [2025-01-09 22:44:50,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2025-01-09 22:44:50,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 30 [2025-01-09 22:44:50,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2025-01-09 22:44:50,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 14 [2025-01-09 22:44:50,622 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:50,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:50,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2025-01-09 22:44:50,748 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:44:50,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:51,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2025-01-09 22:44:51,297 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (and (forall ((v_ArrVal_1654 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse0 0) (< .cse0 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1))))) (or (forall ((v_ArrVal_1652 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1652) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) .cse2) (or .cse2 (< |c_ULTIMATE.start_sll_update_at_~head#1.offset| 1)) (or (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) .cse2)))) is different from false [2025-01-09 22:44:51,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse5)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) 0))) (.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse5))) (and (or .cse0 (forall ((v_ArrVal_1652 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1652) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))) (forall ((v_ArrVal_1654 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (or (< .cse3 0) (< .cse3 (+ .cse4 1))))) (or (= |c_ULTIMATE.start_sll_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| 1)) .cse0) (or .cse0 (< .cse4 1)))))) is different from false [2025-01-09 22:44:51,604 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4)) (.cse0 (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) 0)))) (and (or .cse0 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (forall ((v_ArrVal_1654 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4))) (or (< .cse1 0) (< .cse1 (+ .cse2 1))))) (or .cse0 (< .cse2 1)) (or .cse0 (forall ((v_ArrVal_1652 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1652) |c_ULTIMATE.start_main_~s~0#1.base|) .cse4) .cse3))))))) is different from false [2025-01-09 22:44:51,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3)) (.cse4 (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)))) (and (forall ((v_ArrVal_1654 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse2 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (< .cse0 0) (< .cse0 (+ .cse1 1))))) (or .cse4 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (or .cse4 (< .cse1 1)) (or .cse4 (forall ((v_ArrVal_1652 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse2 v_ArrVal_1652) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) .cse2))))))) is different from false [2025-01-09 22:44:51,699 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_1649 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1649 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1649)) (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1651 Int)) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1649))) (let ((.cse1 (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1651)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (< .cse1 (+ (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 1)) (< .cse1 0))))))) (or (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1651 Int) (v_ArrVal_1649 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1649 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1649)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1649) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1651)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0))) (= |c_ULTIMATE.start_main_~i~0#1| 0)) (forall ((v_ArrVal_1649 (Array Int Int))) (or (forall ((v_ArrVal_1651 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1651)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))) (or (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1649) .cse5 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1652 (Array Int Int))) (= .cse5 (select (select (store .cse6 .cse5 v_ArrVal_1652) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3))))))) (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1649 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1649)))) (forall ((v_ArrVal_1649 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1649))) (or (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1651 Int)) (< (select (select (store .cse7 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse4 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1651)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 0)) (not (= (store .cse0 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_1649 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)) v_ArrVal_1649)) (< (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) 1)))))) is different from false [2025-01-09 22:44:51,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse2 (select .cse4 .cse1))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1649 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)) (< (select v_ArrVal_1649 .cse1) 1) (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1649) .cse2 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1649 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)) (forall ((v_ArrVal_1654 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1649) .cse2 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (or (< .cse3 0) (< .cse3 (+ (select v_ArrVal_1649 .cse1) 1))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1649 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)) (forall ((v_ArrVal_1651 Int)) (or (forall ((v_ArrVal_1652 (Array Int Int))) (= .cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1651)) .cse2 v_ArrVal_1652) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1649) .cse2 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0)))))))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int) (v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1649) .cse2 v_ArrVal_1654) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0))) (= |c_ULTIMATE.start_main_~i~0#1| 0))))) is different from false [2025-01-09 22:44:51,864 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse0 (select .cse3 .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1649) .cse0 v_ArrVal_1654) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 0) (not (= (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1652 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1651)) .cse0 v_ArrVal_1652) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) .cse0)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1649 (Array Int Int))) (or (forall ((v_ArrVal_1654 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1649) .cse0 v_ArrVal_1654) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1))) (or (< .cse4 (+ (select v_ArrVal_1649 .cse1) 1)) (< .cse4 0)))) (not (= (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1649 (Array Int Int))) (or (< (select v_ArrVal_1649 .cse1) 1) (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_1649) .cse0 v_ArrVal_1654) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse1) 0)) (not (= (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)))))) is different from false [2025-01-09 22:44:51,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1651 Int) (v_ArrVal_1652 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1651)) .cse0 v_ArrVal_1652) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1649) .cse0 v_ArrVal_1654) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1649 (Array Int Int))) (or (< (select v_ArrVal_1649 .cse2) 1) (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1649) .cse0 v_ArrVal_1654) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2) 0)) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (forall ((v_ArrVal_1649 (Array Int Int))) (or (forall ((v_ArrVal_1654 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_1649) .cse0 v_ArrVal_1654) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))) (or (< .cse4 0) (< .cse4 (+ (select v_ArrVal_1649 .cse2) 1))))) (not (= (store .cse3 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)))))) is different from false [2025-01-09 22:44:51,946 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select .cse4 .cse2)) (.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1649 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)) (forall ((v_ArrVal_1654 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1649) .cse3 v_ArrVal_1654) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (or (< .cse1 (+ (select v_ArrVal_1649 .cse2) 1)) (< .cse1 0)))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1654 (Array Int Int)) (v_ArrVal_1649 (Array Int Int))) (or (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1649) .cse3 v_ArrVal_1654) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0))) (forall ((v_ArrVal_1651 Int) (v_ArrVal_1652 (Array Int Int))) (= .cse3 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| v_ArrVal_1651)) .cse3 v_ArrVal_1652) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_61| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|) (forall ((v_ArrVal_1649 (Array Int Int))) (or (forall ((v_ArrVal_1654 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_1649) .cse3 v_ArrVal_1654) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0)) (not (= (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61| (select v_ArrVal_1649 |v_ULTIMATE.start_sll_update_at_~head#1.offset_61|)) v_ArrVal_1649)) (< (select v_ArrVal_1649 .cse2) 1)))))))) is different from false [2025-01-09 22:44:51,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 59 [2025-01-09 22:44:51,969 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:51,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:51,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-01-09 22:44:51,976 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 22 treesize of output 14 [2025-01-09 22:44:51,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:44:51,981 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:51,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-01-09 22:44:51,986 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:51,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:51,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-01-09 22:44:51,991 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 16 treesize of output 8 [2025-01-09 22:44:52,001 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:52,003 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2025-01-09 22:44:52,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2025-01-09 22:44:52,296 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:44:52,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-09 22:44:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2025-01-09 22:44:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066022708] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:52,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 79 [2025-01-09 22:44:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644281830] [2025-01-09 22:44:52,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:52,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2025-01-09 22:44:52,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:52,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2025-01-09 22:44:52,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=4607, Unknown=44, NotChecked=1296, Total=6162 [2025-01-09 22:44:52,450 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 79 states, 79 states have (on average 1.7468354430379747) internal successors, (138), 79 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:55,362 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2025-01-09 22:44:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 22:44:55,362 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 1.7468354430379747) internal successors, (138), 79 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 22:44:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:55,363 INFO L225 Difference]: With dead ends: 68 [2025-01-09 22:44:55,363 INFO L226 Difference]: Without dead ends: 68 [2025-01-09 22:44:55,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=519, Invalid=8586, Unknown=51, NotChecked=1764, Total=10920 [2025-01-09 22:44:55,365 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 74 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 482 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:55,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1100 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2110 Invalid, 0 Unknown, 482 Unchecked, 1.0s Time] [2025-01-09 22:44:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-01-09 22:44:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2025-01-09 22:44:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.125) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2025-01-09 22:44:55,367 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 50 [2025-01-09 22:44:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:55,367 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2025-01-09 22:44:55,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 1.7468354430379747) internal successors, (138), 79 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:55,367 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2025-01-09 22:44:55,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:44:55,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:55,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:55,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-01-09 22:44:55,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 22:44:55,572 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:55,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1477347865, now seen corresponding path program 1 times [2025-01-09 22:44:55,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:55,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875116681] [2025-01-09 22:44:55,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:55,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:44:55,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:44:55,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:55,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 22:44:55,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:55,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875116681] [2025-01-09 22:44:55,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875116681] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:55,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:55,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:44:55,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579573894] [2025-01-09 22:44:55,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:55,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:44:55,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:55,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:44:55,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:44:55,680 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:55,821 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2025-01-09 22:44:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:44:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-01-09 22:44:55,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:55,822 INFO L225 Difference]: With dead ends: 63 [2025-01-09 22:44:55,822 INFO L226 Difference]: Without dead ends: 63 [2025-01-09 22:44:55,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:44:55,823 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:55,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 110 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:55,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-01-09 22:44:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-01-09 22:44:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 62 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2025-01-09 22:44:55,825 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 50 [2025-01-09 22:44:55,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:55,825 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2025-01-09 22:44:55,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2025-01-09 22:44:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-09 22:44:55,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:55,825 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:55,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:44:55,826 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:55,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1477347866, now seen corresponding path program 1 times [2025-01-09 22:44:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:55,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327055020] [2025-01-09 22:44:55,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:55,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 22:44:55,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 22:44:55,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:55,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:44:55,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:55,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327055020] [2025-01-09 22:44:55,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327055020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:55,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:55,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:44:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316106913] [2025-01-09 22:44:55,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:55,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:44:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:55,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:44:55,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:44:55,972 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:56,114 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2025-01-09 22:44:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:44:56,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 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 50 [2025-01-09 22:44:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:56,115 INFO L225 Difference]: With dead ends: 65 [2025-01-09 22:44:56,115 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 22:44:56,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:44:56,116 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:56,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 142 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 22:44:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-01-09 22:44:56,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 64 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2025-01-09 22:44:56,118 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 50 [2025-01-09 22:44:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:56,118 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2025-01-09 22:44:56,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2025-01-09 22:44:56,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:44:56,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:56,118 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:56,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:44:56,119 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:56,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:56,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1446844428, now seen corresponding path program 1 times [2025-01-09 22:44:56,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:56,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721965075] [2025-01-09 22:44:56,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:56,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:56,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 22:44:56,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:44:56,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:56,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:56,198 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:44:56,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:56,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721965075] [2025-01-09 22:44:56,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721965075] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:56,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:56,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:44:56,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610397098] [2025-01-09 22:44:56,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:56,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:44:56,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:56,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:44:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:44:56,200 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:56,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:56,300 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2025-01-09 22:44:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:44:56,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-01-09 22:44:56,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:56,301 INFO L225 Difference]: With dead ends: 67 [2025-01-09 22:44:56,301 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 22:44:56,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:44:56,301 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:56,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 188 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 22:44:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2025-01-09 22:44:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.1) internal successors, (66), 64 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2025-01-09 22:44:56,302 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 51 [2025-01-09 22:44:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:56,303 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2025-01-09 22:44:56,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2025-01-09 22:44:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:44:56,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:56,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:56,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:44:56,303 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:56,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:56,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1140419775, now seen corresponding path program 1 times [2025-01-09 22:44:56,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:56,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638484427] [2025-01-09 22:44:56,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:56,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:56,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 22:44:56,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:44:56,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:56,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:44:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638484427] [2025-01-09 22:44:56,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638484427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:44:56,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:44:56,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:44:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774812334] [2025-01-09 22:44:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:44:56,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:44:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:56,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:44:56,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:44:56,408 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:56,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:44:56,518 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2025-01-09 22:44:56,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:44:56,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 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 53 [2025-01-09 22:44:56,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:44:56,519 INFO L225 Difference]: With dead ends: 66 [2025-01-09 22:44:56,519 INFO L226 Difference]: Without dead ends: 66 [2025-01-09 22:44:56,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:44:56,520 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:44:56,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 172 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:44:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-01-09 22:44:56,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-01-09 22:44:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.098360655737705) internal successors, (67), 65 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2025-01-09 22:44:56,521 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 53 [2025-01-09 22:44:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:44:56,521 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2025-01-09 22:44:56,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:44:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2025-01-09 22:44:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:44:56,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:44:56,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:44:56,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 22:44:56,521 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:44:56,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:44:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1054326494, now seen corresponding path program 1 times [2025-01-09 22:44:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:44:56,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949203763] [2025-01-09 22:44:56,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:44:56,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:44:56,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:44:56,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:56,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:44:57,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:44:57,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949203763] [2025-01-09 22:44:57,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949203763] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:44:57,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372476661] [2025-01-09 22:44:57,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:44:57,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:44:57,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:44:57,819 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:44:57,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:44:57,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:44:57,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:44:57,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:44:57,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:44:57,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-01-09 22:44:57,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:44:58,088 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:44:58,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:44:58,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:44:58,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:44:58,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-01-09 22:44:58,585 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:44:58,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:44:58,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:58,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2025-01-09 22:44:58,949 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2025-01-09 22:44:58,950 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 18 treesize of output 13 [2025-01-09 22:44:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:44:58,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:44:59,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:59,129 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 31 treesize of output 35 [2025-01-09 22:44:59,566 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (forall ((v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1970)) .cse1 v_ArrVal_1972) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (forall ((v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1970)) .cse1 v_ArrVal_1972) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)))))) is different from false [2025-01-09 22:44:59,588 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (forall ((v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1970)) .cse1 v_ArrVal_1972) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) .cse1)) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (forall ((v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1970)) .cse1 v_ArrVal_1972) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)))))) is different from false [2025-01-09 22:44:59,620 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (forall ((v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1970)) .cse0 v_ArrVal_1972) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (forall ((v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1970)) .cse0 v_ArrVal_1972) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))))))) is different from false [2025-01-09 22:44:59,634 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|) (forall ((v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1970)) .cse1 v_ArrVal_1972) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) .cse1)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_68| Int)) (or (forall ((v_ArrVal_1970 Int) (v_ArrVal_1972 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_68| v_ArrVal_1970)) .cse1 v_ArrVal_1972) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_68|)))))) is different from false [2025-01-09 22:44:59,641 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:59,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:59,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-01-09 22:44:59,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:44:59,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2025-01-09 22:44:59,653 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 5 treesize of output 3 [2025-01-09 22:44:59,659 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:44:59,662 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-01-09 22:44:59,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 1 [2025-01-09 22:44:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2025-01-09 22:44:59,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372476661] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:44:59,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:44:59,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23, 21] total 63 [2025-01-09 22:44:59,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881876414] [2025-01-09 22:44:59,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:44:59,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-01-09 22:44:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:44:59,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-01-09 22:44:59,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3358, Unknown=4, NotChecked=476, Total=4032 [2025-01-09 22:44:59,757 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand has 64 states, 63 states have (on average 2.015873015873016) internal successors, (127), 64 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:01,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:01,643 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2025-01-09 22:45:01,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 22:45:01,644 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.015873015873016) internal successors, (127), 64 states have internal predecessors, (127), 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 56 [2025-01-09 22:45:01,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:01,644 INFO L225 Difference]: With dead ends: 75 [2025-01-09 22:45:01,647 INFO L226 Difference]: Without dead ends: 75 [2025-01-09 22:45:01,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=488, Invalid=7180, Unknown=4, NotChecked=700, Total=8372 [2025-01-09 22:45:01,649 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 2161 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 2456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 279 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:01,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 544 Invalid, 2456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2161 Invalid, 0 Unknown, 279 Unchecked, 1.0s Time] [2025-01-09 22:45:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-01-09 22:45:01,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2025-01-09 22:45:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.125) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2025-01-09 22:45:01,651 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 56 [2025-01-09 22:45:01,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:01,652 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2025-01-09 22:45:01,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.015873015873016) internal successors, (127), 64 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2025-01-09 22:45:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-01-09 22:45:01,654 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:01,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:01,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-09 22:45:01,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:01,858 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:45:01,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:01,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1054326495, now seen corresponding path program 1 times [2025-01-09 22:45:01,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:01,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192326793] [2025-01-09 22:45:01,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:01,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:01,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:45:01,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:45:01,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:01,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:45:03,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192326793] [2025-01-09 22:45:03,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192326793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267562035] [2025-01-09 22:45:03,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:03,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:03,079 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:45:03,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 22:45:03,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 22:45:03,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 22:45:03,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:03,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:03,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-01-09 22:45:03,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:03,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:45:03,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:45:03,414 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:45:03,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:45:03,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:45:03,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:45:03,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:45:03,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:03,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-01-09 22:45:03,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:03,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:45:03,932 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:45:03,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-01-09 22:45:03,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:45:04,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:04,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-01-09 22:45:04,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:04,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2025-01-09 22:45:04,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:45:04,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:04,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2087 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2087))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0) (not (= v_ArrVal_2087 (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2087 |c_ULTIMATE.start_sll_update_at_~head#1.offset|)))) (forall ((v_ArrVal_2086 Int) (v_ArrVal_2089 (Array Int Int)) (v_ArrVal_2088 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2086)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (<= (+ 8 (select (select (store .cse0 .cse3 v_ArrVal_2089) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_2088) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))))) (forall ((v_ArrVal_2087 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2087))) (or (< (select (select .cse6 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) 0) (forall ((v_ArrVal_2086 Int) (v_ArrVal_2089 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store .cse5 |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2086)) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_2089) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (not (= v_ArrVal_2087 (store .cse2 |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select v_ArrVal_2087 |c_ULTIMATE.start_sll_update_at_~head#1.offset|))))))))) is different from false [2025-01-09 22:45:06,249 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:06,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:06,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2025-01-09 22:45:06,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2025-01-09 22:45:06,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:06,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2025-01-09 22:45:06,277 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:06,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:06,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 8 [2025-01-09 22:45:06,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:06,299 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 30 treesize of output 28 [2025-01-09 22:45:06,327 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 11 treesize of output 9 [2025-01-09 22:45:06,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-01-09 22:45:06,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2025-01-09 22:45:06,344 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:06,346 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:06,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2025-01-09 22:45:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 14 refuted. 1 times theorem prover too weak. 10 trivial. 3 not checked. [2025-01-09 22:45:06,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267562035] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:45:06,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:45:06,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 23] total 69 [2025-01-09 22:45:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161325758] [2025-01-09 22:45:06,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:06,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-01-09 22:45:06,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:06,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-01-09 22:45:06,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=4383, Unknown=67, NotChecked=134, Total=4830 [2025-01-09 22:45:06,915 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 70 states, 69 states have (on average 2.1594202898550723) internal successors, (149), 70 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:09,088 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2025-01-09 22:45:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 22:45:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.1594202898550723) internal successors, (149), 70 states have internal predecessors, (149), 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 56 [2025-01-09 22:45:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:09,089 INFO L225 Difference]: With dead ends: 77 [2025-01-09 22:45:09,089 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 22:45:09,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=431, Invalid=6645, Unknown=68, NotChecked=166, Total=7310 [2025-01-09 22:45:09,090 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 61 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:09,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 536 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1752 Invalid, 0 Unknown, 63 Unchecked, 1.2s Time] [2025-01-09 22:45:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 22:45:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-01-09 22:45:09,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.106060606060606) internal successors, (73), 70 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2025-01-09 22:45:09,092 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 56 [2025-01-09 22:45:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:09,092 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2025-01-09 22:45:09,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.1594202898550723) internal successors, (149), 70 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2025-01-09 22:45:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-01-09 22:45:09,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:09,092 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:09,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-09 22:45:09,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:09,297 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:45:09,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:09,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1675605041, now seen corresponding path program 1 times [2025-01-09 22:45:09,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:09,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715081197] [2025-01-09 22:45:09,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:09,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 22:45:09,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:45:09,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:09,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:10,287 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 22:45:10,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715081197] [2025-01-09 22:45:10,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715081197] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:10,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713536840] [2025-01-09 22:45:10,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:10,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:10,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:10,290 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:45:10,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 22:45:10,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 22:45:10,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 22:45:10,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:10,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:10,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-01-09 22:45:10,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:10,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:45:10,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:45:10,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:45:10,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:10,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-01-09 22:45:11,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:45:11,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-01-09 22:45:11,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:11,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2025-01-09 22:45:11,309 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:45:11,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:11,400 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2199 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2199) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-01-09 22:45:11,522 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2199 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2199) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0))) is different from false [2025-01-09 22:45:11,815 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_83| Int) (v_ArrVal_2197 Int) (v_ArrVal_2199 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_83|) (not (= (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_83| v_ArrVal_2197)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2199)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) is different from false [2025-01-09 22:45:11,904 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:11,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:11,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 30 [2025-01-09 22:45:11,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:11,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2025-01-09 22:45:11,916 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 20 treesize of output 18 [2025-01-09 22:45:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2025-01-09 22:45:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713536840] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:45:12,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:45:12,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 25] total 62 [2025-01-09 22:45:12,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990481321] [2025-01-09 22:45:12,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:12,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-01-09 22:45:12,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:12,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-01-09 22:45:12,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3149, Unknown=81, NotChecked=348, Total=3782 [2025-01-09 22:45:12,032 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 62 states, 62 states have (on average 2.161290322580645) internal successors, (134), 62 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:13,521 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2025-01-09 22:45:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 22:45:13,521 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.161290322580645) internal successors, (134), 62 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-01-09 22:45:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:13,521 INFO L225 Difference]: With dead ends: 77 [2025-01-09 22:45:13,521 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 22:45:13,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=506, Invalid=6735, Unknown=81, NotChecked=510, Total=7832 [2025-01-09 22:45:13,522 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 91 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:13,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 494 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1572 Invalid, 0 Unknown, 201 Unchecked, 0.7s Time] [2025-01-09 22:45:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 22:45:13,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-01-09 22:45:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2025-01-09 22:45:13,525 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 57 [2025-01-09 22:45:13,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:13,525 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2025-01-09 22:45:13,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.161290322580645) internal successors, (134), 62 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:13,525 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2025-01-09 22:45:13,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 22:45:13,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:13,525 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:13,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-09 22:45:13,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:13,729 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:45:13,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:13,730 INFO L85 PathProgramCache]: Analyzing trace with hash 344802778, now seen corresponding path program 1 times [2025-01-09 22:45:13,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:13,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667157924] [2025-01-09 22:45:13,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:13,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:13,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:45:13,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:45:13,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:13,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:45:15,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:15,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667157924] [2025-01-09 22:45:15,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667157924] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:15,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606668867] [2025-01-09 22:45:15,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:45:15,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:15,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:15,046 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:45:15,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-09 22:45:15,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 22:45:15,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 22:45:15,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:45:15,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:15,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 22:45:15,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:15,388 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:45:15,388 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-01-09 22:45:15,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:45:15,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:45:15,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-01-09 22:45:15,891 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:45:15,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:45:16,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:16,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2025-01-09 22:45:16,085 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-09 22:45:16,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:16,251 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2310) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-01-09 22:45:16,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2310) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2025-01-09 22:45:20,527 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_90| Int) (v_ArrVal_2308 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_90|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_90| v_ArrVal_2308)) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2310)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2025-01-09 22:45:20,538 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_90| Int) (v_ArrVal_2308 Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_90|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_90| v_ArrVal_2308)) (select .cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2310)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2025-01-09 22:45:20,546 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_90| Int) (v_ArrVal_2308 Int)) (or (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_90| v_ArrVal_2308)) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2310)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_90|))) is different from false [2025-01-09 22:45:20,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2310 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_90| Int) (v_ArrVal_2308 Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_90|) (< (select (select (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_90| v_ArrVal_2308)) (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2310)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2025-01-09 22:45:20,560 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:20,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:20,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-01-09 22:45:20,572 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:20,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 30 [2025-01-09 22:45:20,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-01-09 22:45:20,710 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:45:20,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2025-01-09 22:45:20,771 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 9 not checked. [2025-01-09 22:45:20,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606668867] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:45:20,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:45:20,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23, 24] total 63 [2025-01-09 22:45:20,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469200139] [2025-01-09 22:45:20,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:45:20,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-01-09 22:45:20,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:45:20,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-01-09 22:45:20,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=3029, Unknown=74, NotChecked=702, Total=4032 [2025-01-09 22:45:20,772 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 64 states, 63 states have (on average 2.126984126984127) internal successors, (134), 64 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:22,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:45:22,704 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2025-01-09 22:45:22,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 22:45:22,705 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.126984126984127) internal successors, (134), 64 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-01-09 22:45:22,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:45:22,705 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:45:22,705 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:45:22,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 83 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=497, Invalid=6095, Unknown=74, NotChecked=990, Total=7656 [2025-01-09 22:45:22,707 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 75 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 22:45:22,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 751 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1905 Invalid, 0 Unknown, 409 Unchecked, 0.9s Time] [2025-01-09 22:45:22,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:45:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2025-01-09 22:45:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2025-01-09 22:45:22,708 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 59 [2025-01-09 22:45:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:45:22,708 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2025-01-09 22:45:22,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.126984126984127) internal successors, (134), 64 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:45:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2025-01-09 22:45:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-01-09 22:45:22,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:45:22,709 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:45:22,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-01-09 22:45:22,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:22,909 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2025-01-09 22:45:22,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:45:22,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1542091805, now seen corresponding path program 2 times [2025-01-09 22:45:22,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:45:22,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683120641] [2025-01-09 22:45:22,910 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:45:22,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:45:22,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-01-09 22:45:22,937 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 22:45:22,937 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:45:22,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:45:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:45:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683120641] [2025-01-09 22:45:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683120641] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:45:24,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510820714] [2025-01-09 22:45:24,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:45:24,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:45:24,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:45:24,925 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:45:24,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-09 22:45:25,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 62 statements into 2 equivalence classes. [2025-01-09 22:45:25,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 22:45:25,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:45:25,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:45:25,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 114 conjuncts are in the unsatisfiable core [2025-01-09 22:45:25,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:45:25,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:45:25,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:45:25,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:45:25,361 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:45:25,361 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-01-09 22:45:25,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:45:25,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:45:25,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:45:25,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:45:25,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:45:25,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:45:25,837 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2025-01-09 22:45:25,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2025-01-09 22:45:25,856 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 22:45:25,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2025-01-09 22:45:26,435 INFO L349 Elim1Store]: treesize reduction 116, result has 43.4 percent of original size [2025-01-09 22:45:26,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 128 treesize of output 162 [2025-01-09 22:45:26,539 INFO L349 Elim1Store]: treesize reduction 108, result has 47.3 percent of original size [2025-01-09 22:45:26,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 129 [2025-01-09 22:45:38,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:45:38,164 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2025-01-09 22:45:38,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 43 [2025-01-09 22:45:38,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:45:38,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 24 treesize of output 18 [2025-01-09 22:45:38,219 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:45:38,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:45:38,295 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 10 treesize of output 8 [2025-01-09 22:45:47,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (forall ((v_ArrVal_2428 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse1 (select .cse5 4)) (.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2428)) (.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse5))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (not (= (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432)) (= (select (let ((.cse3 (select .cse4 4))) (select (store .cse2 .cse3 v_ArrVal_2432) (select (select (store .cse0 .cse3 (store (select .cse0 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0))))) (not (= (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| (select v_ArrVal_2428 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|)) v_ArrVal_2428)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int) (v_ArrVal_2433 Int)) (let ((.cse7 (let ((.cse11 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse11)) (.cse10 (select .cse11 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (= (select (select .cse7 .cse8) 4) 0) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (= |c_ULTIMATE.start_main_~s~0#1.base| .cse8) (< (select .cse6 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|))))))) is different from false [2025-01-09 22:45:47,786 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int) (v_ArrVal_2433 Int)) (let ((.cse2 (let ((.cse5 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (.cse4 (select .cse5 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (< (select .cse1 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select .cse2 .cse0) 4) 0))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (forall ((v_ArrVal_2428 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse11 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse11)) (.cse9 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2428)) (.cse8 (select .cse11 4))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select (store .cse7 .cse8 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (= (select (let ((.cse10 (select .cse6 4))) (select (store .cse9 .cse10 v_ArrVal_2432) (select (select (store .cse7 .cse10 (store (select .cse7 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0) (not (= v_ArrVal_2432 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)))))))) (not (= (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| (select v_ArrVal_2428 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|)) v_ArrVal_2428)))))))) is different from false [2025-01-09 22:45:47,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int) (v_ArrVal_2433 Int)) (let ((.cse2 (let ((.cse5 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse5)) (.cse4 (select .cse5 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (< (select .cse1 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select .cse2 .cse0) 4) 0))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (forall ((v_ArrVal_2428 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| (select v_ArrVal_2428 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|)) v_ArrVal_2428)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse11 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse8 (select .cse11 4)) (.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2428)) (.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse11))) (or (not (= v_ArrVal_2432 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)))) (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select (store .cse9 .cse8 (store (select .cse9 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (select (let ((.cse10 (select .cse6 4))) (select (store .cse7 .cse10 v_ArrVal_2432) (select (select (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0))))))))))) is different from false [2025-01-09 22:45:47,864 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (forall ((v_ArrVal_2428 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse1 (select .cse5 4)) (.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2428)) (.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (= (select (let ((.cse3 (select .cse4 4))) (select (store .cse0 .cse3 v_ArrVal_2432) (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0))))) (not (= (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| (select v_ArrVal_2428 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|)) v_ArrVal_2428)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int) (v_ArrVal_2433 Int)) (let ((.cse8 (let ((.cse11 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse11)) (.cse10 (select .cse11 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7) (< (select .cse6 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select .cse8 .cse7) 4) 0))))))) is different from false [2025-01-09 22:45:47,913 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse6 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse2 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int) (v_ArrVal_2433 Int)) (let ((.cse0 (let ((.cse5 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse5)) (.cse4 (select .cse5 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (= (select (select .cse0 .cse1) 4) 0) (< (select .cse2 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (forall ((v_ArrVal_2428 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse11 (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2428)) (.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse11)) (.cse8 (select .cse11 4))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (not (= v_ArrVal_2432 (store (select .cse7 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)))) (= (select (let ((.cse9 (select .cse6 4))) (select (store .cse7 .cse9 v_ArrVal_2432) (select (select (store .cse10 .cse9 (store (select .cse10 .cse9) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (store .cse10 .cse8 (store (select .cse10 .cse8) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))) (not (= v_ArrVal_2428 (store .cse2 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| (select v_ArrVal_2428 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|))))))))))) is different from false [2025-01-09 22:45:47,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse0 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse5 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (forall ((v_ArrVal_2428 (Array Int Int))) (or (not (= v_ArrVal_2428 (store .cse0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| (select v_ArrVal_2428 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse6 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse6)) (.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_#res#1.base| v_ArrVal_2428)) (.cse2 (select .cse6 4))) (or (= |c_ULTIMATE.start_node_create_#res#1.base| (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_#res#1.base|) 4)) (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= 0 (select (let ((.cse4 (select .cse5 4))) (select (store .cse3 .cse4 v_ArrVal_2432) (select (select (store .cse1 .cse4 (store (select .cse1 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4)) (not (= v_ArrVal_2432 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)))))))))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int) (v_ArrVal_2433 Int)) (let ((.cse8 (let ((.cse11 (store .cse5 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse11)) (.cse10 (select .cse11 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (= |c_ULTIMATE.start_node_create_#res#1.base| .cse7) (< (select .cse0 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select .cse8 .cse7) 4) 0)))))))) is different from false [2025-01-09 22:45:48,019 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse6 (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse4 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (forall ((v_ArrVal_2428 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse5 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428)) (.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse5)) (.cse1 (select .cse5 4))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (not (= (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432)) (= (select (let ((.cse2 (select .cse4 4))) (select (store .cse0 .cse2 v_ArrVal_2432) (select (select (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)))))) (not (= (store .cse6 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| (select v_ArrVal_2428 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|)) v_ArrVal_2428)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2430 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_98| Int) (v_ArrVal_2433 Int)) (let ((.cse7 (let ((.cse11 (store .cse4 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98| v_ArrVal_2430))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse11)) (.cse10 (select .cse11 4))) (store .cse9 .cse10 (store (select .cse9 .cse10) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_98|) (= (select (select .cse7 .cse8) 4) 0) (< (select .cse6 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8)))))))) is different from false [2025-01-09 22:45:48,032 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:48,035 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:48,080 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-01-09 22:45:48,081 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 237 treesize of output 193 [2025-01-09 22:45:48,109 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2025-01-09 22:45:48,109 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 1 case distinctions, treesize of input 14 treesize of output 15 [2025-01-09 22:45:48,612 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:48,615 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:45:48,647 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2025-01-09 22:45:48,648 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 171 [2025-01-09 22:45:48,654 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 18 treesize of output 16 [2025-01-09 22:45:49,012 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse29 (< 0 .cse2)) (.cse30 (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) (and (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10)) (.cse4 (select v_arrayElimArr_10 4))) (store .cse3 .cse4 (store (select .cse3 .cse4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select .cse0 .cse1) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse1) (not (= (select v_arrayElimArr_10 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2433 Int)) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse6 (store .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse5) (= (select (select .cse6 .cse5) 4) 0) (= (select (let ((.cse7 (let ((.cse9 (select v_arrayElimArr_10 4))) (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (select .cse7 (select (select .cse7 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (not (= (select v_arrayElimArr_10 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse12 (let ((.cse14 (select v_arrayElimArr_10 4))) (store .cse11 .cse14 (store (select .cse11 .cse14) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (let ((.cse10 (store .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse12 .cse13) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse13) (not (= (select v_arrayElimArr_10 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse16 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse17 (let ((.cse19 (select v_arrayElimArr_10 4))) (store .cse16 .cse19 (store (select .cse16 .cse19) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (let ((.cse18 (select (select .cse17 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (let ((.cse15 (store .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse16 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse17 .cse18) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse18)))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse20 (let ((.cse22 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10)) (.cse23 (select v_arrayElimArr_10 4))) (store .cse22 .cse23 (store (select .cse22 .cse23) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (let ((.cse21 (select (select .cse20 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select .cse20 .cse21) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse21))))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse25 (store .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse24) (= (select (select .cse25 .cse24) 4) 0) (= (select (let ((.cse26 (let ((.cse28 (select v_arrayElimArr_10 4))) (store .cse27 .cse28 (store (select .cse27 .cse28) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))))))) .cse29)) .cse30) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse32 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse33 (let ((.cse35 (select v_arrayElimArr_10 4))) (store .cse32 .cse35 (store (select .cse32 .cse35) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (let ((.cse34 (select (select .cse33 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (let ((.cse31 (store .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse32 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))) (select .cse31 (select (select .cse31 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse33 .cse34) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse34) (not (= (select v_arrayElimArr_10 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) .cse30) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int))) (or (forall ((v_ArrVal_2433 Int)) (let ((.cse39 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse37 (store .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse39 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))) (let ((.cse36 (select (select .cse37 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse36) (= (select (select .cse37 .cse36) 4) 0) (= (select (let ((.cse38 (let ((.cse40 (select v_arrayElimArr_10 4))) (store .cse39 .cse40 (store (select .cse39 .cse40) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (select .cse38 (select (select .cse38 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (not (= (select v_arrayElimArr_10 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|))) (or .cse30 (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2433 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse43 (select v_arrayElimArr_9 4))) (let ((.cse41 (select (select (let ((.cse44 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_9))) (store .cse44 .cse43 (store (select .cse44 .cse43) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (not (= (select v_arrayElimArr_9 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse41) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (let ((.cse42 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (not (= (select v_ArrVal_2428 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (select (store .cse42 .cse43 v_ArrVal_2432) .cse41) 4) 0) (not (= (store (select .cse42 .cse43) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432))))))))) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse48 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_9)) (.cse46 (select v_arrayElimArr_9 4))) (let ((.cse47 (select (select (store .cse48 .cse46 (store (select .cse48 .cse46) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse45 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select (store .cse45 .cse46 v_ArrVal_2432) .cse47) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse47) (= 0 (select (select (store .cse45 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2432) (select (select (store .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse48 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4)) (not (= (store (select .cse45 .cse46) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432)))))) .cse29) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse50 (select v_arrayElimArr_9 4))) (let ((.cse51 (select (select (let ((.cse52 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_9))) (store .cse52 .cse50 (store (select .cse52 .cse50) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse49 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select (store .cse49 .cse50 v_ArrVal_2432) .cse51) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse51) (not (= (store (select .cse49 .cse50) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432)))))) .cse29) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2433 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_9)) (.cse54 (select v_arrayElimArr_9 4))) (let ((.cse55 (select (select (store .cse56 .cse54 (store (select .cse56 .cse54) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (let ((.cse53 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (not (= (select v_ArrVal_2428 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (select (store .cse53 .cse54 v_ArrVal_2432) .cse55) 4) 0) (= 0 (select (select (store .cse53 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2432) (select (select (store .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse56 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4)) (not (= (store (select .cse53 .cse54) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432))))) (not (= (select v_arrayElimArr_9 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse55))))))) (or (not .cse30) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse57 (select v_ArrVal_2428 4)) (.cse58 (select (select (let ((.cse60 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_9))) (store .cse60 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse60 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse59 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428))) (or (not (= .cse57 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse58) (< .cse57 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (not (= (select v_arrayElimArr_9 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= 0 (select (select (store .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2432) .cse58) 4)) (not (= v_ArrVal_2432 (store (select .cse59 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)))))))) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse62 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse63 (let ((.cse65 (select v_arrayElimArr_10 4))) (store .cse62 .cse65 (store (select .cse62 .cse65) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (let ((.cse64 (select (select .cse63 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (let ((.cse61 (store .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse62 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))) (select .cse61 (select (select .cse61 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (= (select (select .cse63 .cse64) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse64)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse69 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10))) (let ((.cse67 (store .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse69 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)))) (let ((.cse66 (select (select .cse67 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse66) (= (select (select .cse67 .cse66) 4) 0) (= (select (let ((.cse68 (let ((.cse70 (select v_arrayElimArr_10 4))) (store .cse69 .cse70 (store (select .cse69 .cse70) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (select .cse68 (select (select .cse68 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse71 (let ((.cse73 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10)) (.cse74 (select v_arrayElimArr_10 4))) (store .cse73 .cse74 (store (select .cse73 .cse74) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (let ((.cse72 (select (select .cse71 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (= (select (select .cse71 .cse72) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse72)))))))) .cse29) (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_2433 Int)) (let ((.cse75 (let ((.cse77 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_10)) (.cse78 (select v_arrayElimArr_10 4))) (store .cse77 .cse78 (store (select .cse77 .cse78) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433))))) (let ((.cse76 (select (select .cse75 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select .cse75 .cse76) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse76) (not (= (select v_arrayElimArr_10 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))))) .cse30) (or (and (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse82 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_9))) (let ((.cse79 (select (select (store .cse82 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse82 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (.cse80 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428)) (.cse81 (select v_arrayElimArr_9 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse79) (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select (store .cse80 .cse81 v_ArrVal_2432) (select (select (store .cse82 .cse81 (store (select .cse82 .cse81) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= 0 (select (select (store .cse80 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2432) .cse79) 4)) (not (= (store (select .cse80 .cse81) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432)))))) .cse29) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2433 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_9))) (let ((.cse86 (select (select (store .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse85 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) (or (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (let ((.cse83 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428)) (.cse84 (select v_arrayElimArr_9 4))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (not (= (select v_ArrVal_2428 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (select (store .cse83 .cse84 v_ArrVal_2432) (select (select (store .cse85 .cse84 (store (select .cse85 .cse84) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (= 0 (select (select (store .cse83 |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2432) .cse86) 4)) (not (= (store (select .cse83 .cse84) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432))))) (= |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse86) (not (= (select v_arrayElimArr_9 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))))) .cse30) (or (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2433 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse87 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_9))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse87 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (not (= (select v_arrayElimArr_9 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2432 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428)) (.cse89 (select v_arrayElimArr_9 4))) (or (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (not (= (select v_ArrVal_2428 .cse2) |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (= (select (select (store .cse88 .cse89 v_ArrVal_2432) (select (select (store .cse87 .cse89 (store (select .cse87 .cse89) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse88 .cse89) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432)))))))) (or .cse29 (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_95| Int) (v_ArrVal_2428 (Array Int Int)) (v_ArrVal_2432 (Array Int Int)) (v_ArrVal_2433 Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse90 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_9)) (.cse91 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_2428)) (.cse92 (select v_arrayElimArr_9 4))) (or (= |c_ULTIMATE.start_node_create_~temp~0#1.base| (select (select (store .cse90 |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select .cse90 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) (< (select v_ArrVal_2428 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|) (= (select (select (store .cse91 .cse92 v_ArrVal_2432) (select (select (store .cse90 .cse92 (store (select .cse90 .cse92) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| v_ArrVal_2433)) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4)) 4) 0) (not (= (store (select .cse91 .cse92) |v_ULTIMATE.start_sll_update_at_~head#1.offset_95| (select v_ArrVal_2432 |v_ULTIMATE.start_sll_update_at_~head#1.offset_95|)) v_ArrVal_2432))))))) .cse30)))) is different from false