./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-sll.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-shared-sll.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 2fa49e67cf70129223df227686710f59267eaca2c9c0899d0fe3cafabfccfe68 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:34:57,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:34:57,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 06:34:57,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:34:57,605 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:34:57,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:34:57,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:34:57,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:34:57,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:34:57,628 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:34:57,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:34:57,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:34:57,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:34:57,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:34:57,629 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:34:57,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:34:57,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:34:57,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:34:57,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:34:57,631 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:34:57,631 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:34:57,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:34:57,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:34:57,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:34:57,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:34:57,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:34:57,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:34:57,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:34:57,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:34:57,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:34:57,632 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2fa49e67cf70129223df227686710f59267eaca2c9c0899d0fe3cafabfccfe68 [2025-02-08 06:34:57,896 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:34:57,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:34:57,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:34:57,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:34:57,908 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:34:57,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-sll.i [2025-02-08 06:34:59,127 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4974a3ce/8592c2c4b7504ec0ba23611b29c28cd0/FLAGec2370135 [2025-02-08 06:34:59,391 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:34:59,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll.i [2025-02-08 06:34:59,409 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4974a3ce/8592c2c4b7504ec0ba23611b29c28cd0/FLAGec2370135 [2025-02-08 06:34:59,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e4974a3ce/8592c2c4b7504ec0ba23611b29c28cd0 [2025-02-08 06:34:59,423 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:34:59,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:34:59,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:34:59,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:34:59,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:34:59,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,429 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb21166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59, skipping insertion in model container [2025-02-08 06:34:59,429 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:34:59,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:34:59,692 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:34:59,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:34:59,733 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:34:59,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59 WrapperNode [2025-02-08 06:34:59,734 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:34:59,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:34:59,735 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:34:59,735 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:34:59,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,762 INFO L138 Inliner]: procedures = 121, calls = 29, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2025-02-08 06:34:59,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:34:59,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:34:59,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:34:59,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:34:59,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,784 INFO L175 MemorySlicer]: Split 14 memory accesses to 1 slices as follows [14]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2025-02-08 06:34:59,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,788 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:34:59,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:34:59,794 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:34:59,794 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:34:59,795 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (1/1) ... [2025-02-08 06:34:59,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:34:59,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:34:59,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:34:59,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:34:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2025-02-08 06:34:59,839 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2025-02-08 06:34:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-02-08 06:34:59,839 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-02-08 06:34:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:34:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:34:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:34:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:34:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:34:59,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:34:59,911 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:34:59,912 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:35:00,175 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-08 06:35:00,175 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:35:00,186 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:35:00,187 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:35:00,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:35:00 BoogieIcfgContainer [2025-02-08 06:35:00,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:35:00,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:35:00,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:35:00,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:35:00,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:34:59" (1/3) ... [2025-02-08 06:35:00,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8452a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:35:00, skipping insertion in model container [2025-02-08 06:35:00,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:59" (2/3) ... [2025-02-08 06:35:00,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8452a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:35:00, skipping insertion in model container [2025-02-08 06:35:00,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:35:00" (3/3) ... [2025-02-08 06:35:00,196 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-shared-sll.i [2025-02-08 06:35:00,208 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:35:00,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-shared-sll.i that has 3 procedures, 92 locations, 1 initial locations, 5 loop locations, and 35 error locations. [2025-02-08 06:35:00,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:35:00,257 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;@766c7891, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:35:00,257 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-02-08 06:35:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 50 states have (on average 1.86) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:35:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:35:00,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:00,266 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:35:00,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:00,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash 3674125, now seen corresponding path program 1 times [2025-02-08 06:35:00,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:00,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128104433] [2025-02-08 06:35:00,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:00,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:35:00,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:35:00,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:00,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:00,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:00,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:00,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128104433] [2025-02-08 06:35:00,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128104433] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:00,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:00,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:00,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122681410] [2025-02-08 06:35:00,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:00,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:00,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:00,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:00,432 INFO L87 Difference]: Start difference. First operand has 92 states, 50 states have (on average 1.86) internal successors, (93), 85 states have internal predecessors, (93), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:00,507 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2025-02-08 06:35:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:35:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:00,513 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:35:00,513 INFO L226 Difference]: Without dead ends: 88 [2025-02-08 06:35:00,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:00,516 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:00,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 151 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:00,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-08 06:35:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-02-08 06:35:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 81 states have internal predecessors, (87), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:35:00,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2025-02-08 06:35:00,547 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 4 [2025-02-08 06:35:00,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:00,548 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2025-02-08 06:35:00,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:00,549 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2025-02-08 06:35:00,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-08 06:35:00,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:00,549 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-08 06:35:00,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:35:00,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:00,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:00,551 INFO L85 PathProgramCache]: Analyzing trace with hash 3674126, now seen corresponding path program 1 times [2025-02-08 06:35:00,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:00,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285854770] [2025-02-08 06:35:00,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:00,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:00,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-08 06:35:00,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-08 06:35:00,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:00,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:00,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285854770] [2025-02-08 06:35:00,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285854770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:00,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:00,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:00,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366457474] [2025-02-08 06:35:00,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:00,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:00,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:00,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:00,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:00,642 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:00,682 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2025-02-08 06:35:00,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:00,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-08 06:35:00,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:00,683 INFO L225 Difference]: With dead ends: 86 [2025-02-08 06:35:00,683 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 06:35:00,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:00,684 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:00,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 154 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:00,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 06:35:00,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-02-08 06:35:00,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 79 states have internal predecessors, (85), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:35:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2025-02-08 06:35:00,691 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 4 [2025-02-08 06:35:00,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:00,692 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2025-02-08 06:35:00,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:35:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2025-02-08 06:35:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:35:00,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:00,693 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:00,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:35:00,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:00,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -37235305, now seen corresponding path program 1 times [2025-02-08 06:35:00,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:00,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714770414] [2025-02-08 06:35:00,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:00,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:00,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:35:00,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:35:00,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:00,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:00,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:00,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714770414] [2025-02-08 06:35:00,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714770414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:00,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:00,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:00,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530178905] [2025-02-08 06:35:00,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:00,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:00,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:00,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:00,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:00,774 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:00,828 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2025-02-08 06:35:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:00,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 06:35:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:00,830 INFO L225 Difference]: With dead ends: 85 [2025-02-08 06:35:00,830 INFO L226 Difference]: Without dead ends: 85 [2025-02-08 06:35:00,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:00,830 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:00,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 146 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-08 06:35:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-02-08 06:35:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 78 states have internal predecessors, (84), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:35:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-02-08 06:35:00,840 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 12 [2025-02-08 06:35:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:00,841 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-02-08 06:35:00,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-02-08 06:35:00,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:35:00,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:00,842 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:00,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:35:00,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:00,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:00,844 INFO L85 PathProgramCache]: Analyzing trace with hash -37235304, now seen corresponding path program 1 times [2025-02-08 06:35:00,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:00,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831113902] [2025-02-08 06:35:00,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:00,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:00,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:35:00,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:35:00,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:00,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:00,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:00,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:00,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831113902] [2025-02-08 06:35:00,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831113902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:00,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:00,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:35:00,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560136292] [2025-02-08 06:35:00,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:00,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:35:00,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:00,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:35:00,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:00,919 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:00,965 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2025-02-08 06:35:00,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:35:00,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-02-08 06:35:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:00,966 INFO L225 Difference]: With dead ends: 84 [2025-02-08 06:35:00,967 INFO L226 Difference]: Without dead ends: 84 [2025-02-08 06:35:00,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:35:00,968 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:00,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 152 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-08 06:35:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-08 06:35:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.6938775510204083) internal successors, (83), 77 states have internal predecessors, (83), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:35:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2025-02-08 06:35:00,975 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 12 [2025-02-08 06:35:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:00,975 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2025-02-08 06:35:00,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:35:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2025-02-08 06:35:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:35:00,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:00,976 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:00,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:35:00,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:00,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1920983065, now seen corresponding path program 1 times [2025-02-08 06:35:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:00,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949427348] [2025-02-08 06:35:00,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:00,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:35:01,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:35:01,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:01,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:01,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:01,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949427348] [2025-02-08 06:35:01,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949427348] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:01,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:01,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:35:01,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619844473] [2025-02-08 06:35:01,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:01,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:35:01,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:01,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:35:01,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:35:01,251 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:01,501 INFO L93 Difference]: Finished difference Result 86 states and 96 transitions. [2025-02-08 06:35:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:35:01,502 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-08 06:35:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:01,503 INFO L225 Difference]: With dead ends: 86 [2025-02-08 06:35:01,503 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 06:35:01,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:35:01,503 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 24 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:01,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 350 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 06:35:01,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2025-02-08 06:35:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 77 states have internal predecessors, (85), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:35:01,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2025-02-08 06:35:01,513 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 20 [2025-02-08 06:35:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2025-02-08 06:35:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:01,513 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2025-02-08 06:35:01,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:35:01,514 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:01,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:01,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:35:01,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:01,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:01,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1920983064, now seen corresponding path program 1 times [2025-02-08 06:35:01,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:01,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202433152] [2025-02-08 06:35:01,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:01,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:01,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:35:01,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:35:01,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:01,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:01,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:01,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202433152] [2025-02-08 06:35:01,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202433152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:01,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:01,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:35:01,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352202260] [2025-02-08 06:35:01,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:01,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:35:01,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:01,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:35:01,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:35:01,825 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:02,115 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-02-08 06:35:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:35:02,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-08 06:35:02,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:02,118 INFO L225 Difference]: With dead ends: 102 [2025-02-08 06:35:02,118 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 06:35:02,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:35:02,118 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 14 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:02,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 442 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:02,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 06:35:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-02-08 06:35:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.578125) internal successors, (101), 89 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 113 transitions. [2025-02-08 06:35:02,127 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 113 transitions. Word has length 20 [2025-02-08 06:35:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:02,127 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 113 transitions. [2025-02-08 06:35:02,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:02,128 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2025-02-08 06:35:02,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:35:02,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:02,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:02,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:35:02,129 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:02,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash -439268409, now seen corresponding path program 1 times [2025-02-08 06:35:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:02,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994031890] [2025-02-08 06:35:02,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:02,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:02,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:35:02,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:35:02,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:02,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:02,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:02,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994031890] [2025-02-08 06:35:02,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994031890] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:02,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296580269] [2025-02-08 06:35:02,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:02,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:02,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:02,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:02,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:35:02,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:35:02,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:35:02,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:02,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:02,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-08 06:35:02,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:02,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:02,450 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-02-08 06:35:02,482 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:35:02,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:35:02,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-08 06:35:02,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:02,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296580269] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:02,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:02,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-02-08 06:35:02,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133861930] [2025-02-08 06:35:02,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:02,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:35:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:02,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:35:02,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-02-08 06:35:02,535 INFO L87 Difference]: Start difference. First operand 98 states and 113 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:35:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:02,742 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2025-02-08 06:35:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:02,742 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-02-08 06:35:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:02,742 INFO L225 Difference]: With dead ends: 99 [2025-02-08 06:35:02,743 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 06:35:02,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:35:02,743 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 7 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:02,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 353 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 231 Invalid, 0 Unknown, 91 Unchecked, 0.1s Time] [2025-02-08 06:35:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 06:35:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 06:35:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 89 states have internal predecessors, (102), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:35:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2025-02-08 06:35:02,751 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 25 [2025-02-08 06:35:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:02,751 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2025-02-08 06:35:02,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:35:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2025-02-08 06:35:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:35:02,752 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:02,752 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:02,758 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-02-08 06:35:02,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:02,953 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:02,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash -439268408, now seen corresponding path program 1 times [2025-02-08 06:35:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:02,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228319000] [2025-02-08 06:35:02,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:02,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:35:02,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:35:02,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:02,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:03,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228319000] [2025-02-08 06:35:03,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228319000] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:03,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938807638] [2025-02-08 06:35:03,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:03,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:03,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:03,167 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:03,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:35:03,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:35:03,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:35:03,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:03,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:03,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:35:03,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:03,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:03,290 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2025-02-08 06:35:03,322 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:35:03,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 06:35:03,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-08 06:35:03,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:03,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938807638] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:03,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:03,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2025-02-08 06:35:03,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910407160] [2025-02-08 06:35:03,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:03,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:35:03,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:03,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:35:03,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2025-02-08 06:35:03,390 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:35:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:03,548 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2025-02-08 06:35:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:03,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-02-08 06:35:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:03,549 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:35:03,549 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 06:35:03,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:35:03,550 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:03,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 447 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 229 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2025-02-08 06:35:03,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 06:35:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-02-08 06:35:03,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.537313432835821) internal successors, (103), 91 states have internal predecessors, (103), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:35:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 117 transitions. [2025-02-08 06:35:03,554 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 117 transitions. Word has length 25 [2025-02-08 06:35:03,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:03,554 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 117 transitions. [2025-02-08 06:35:03,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:35:03,554 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 117 transitions. [2025-02-08 06:35:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:35:03,554 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:03,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:03,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:03,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:03,759 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:03,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1425420648, now seen corresponding path program 1 times [2025-02-08 06:35:03,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:03,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706322212] [2025-02-08 06:35:03,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:03,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:03,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:35:03,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:35:03,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:03,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:03,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:03,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:03,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706322212] [2025-02-08 06:35:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706322212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:03,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:03,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:35:03,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256372043] [2025-02-08 06:35:03,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:03,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:35:03,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:03,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:35:03,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:35:03,815 INFO L87 Difference]: Start difference. First operand 101 states and 117 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:03,894 INFO L93 Difference]: Finished difference Result 118 states and 138 transitions. [2025-02-08 06:35:03,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:35:03,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-02-08 06:35:03,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:03,895 INFO L225 Difference]: With dead ends: 118 [2025-02-08 06:35:03,895 INFO L226 Difference]: Without dead ends: 118 [2025-02-08 06:35:03,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:03,895 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 31 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:03,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 222 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-08 06:35:03,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2025-02-08 06:35:03,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 102 states have internal predecessors, (121), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:35:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2025-02-08 06:35:03,899 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 25 [2025-02-08 06:35:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:03,900 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2025-02-08 06:35:03,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2025-02-08 06:35:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:35:03,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:03,900 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:03,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:35:03,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:03,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:03,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1425420649, now seen corresponding path program 1 times [2025-02-08 06:35:03,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:03,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393192105] [2025-02-08 06:35:03,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:03,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:03,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:35:03,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:35:03,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:03,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393192105] [2025-02-08 06:35:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393192105] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350734410] [2025-02-08 06:35:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:04,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:35:04,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:04,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:35:04,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:04,053 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:04,155 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2025-02-08 06:35:04,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:04,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2025-02-08 06:35:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:04,157 INFO L225 Difference]: With dead ends: 117 [2025-02-08 06:35:04,157 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 06:35:04,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:35:04,158 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:04,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 436 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:04,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 06:35:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2025-02-08 06:35:04,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 105 states have internal predecessors, (125), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:35:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 139 transitions. [2025-02-08 06:35:04,167 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 139 transitions. Word has length 25 [2025-02-08 06:35:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:04,168 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 139 transitions. [2025-02-08 06:35:04,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 139 transitions. [2025-02-08 06:35:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 06:35:04,168 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:04,168 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:04,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:35:04,172 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:04,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:04,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1238362205, now seen corresponding path program 1 times [2025-02-08 06:35:04,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:04,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856401768] [2025-02-08 06:35:04,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:04,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:04,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 06:35:04,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 06:35:04,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:04,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:04,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:04,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:04,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856401768] [2025-02-08 06:35:04,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856401768] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:04,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:04,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:04,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368530626] [2025-02-08 06:35:04,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:04,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:04,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:04,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:04,245 INFO L87 Difference]: Start difference. First operand 115 states and 139 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:04,275 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2025-02-08 06:35:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-08 06:35:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:04,277 INFO L225 Difference]: With dead ends: 117 [2025-02-08 06:35:04,277 INFO L226 Difference]: Without dead ends: 117 [2025-02-08 06:35:04,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:04,277 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 24 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:04,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 438 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-08 06:35:04,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-02-08 06:35:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 106 states have internal predecessors, (124), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:35:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2025-02-08 06:35:04,281 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 26 [2025-02-08 06:35:04,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:04,282 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2025-02-08 06:35:04,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2025-02-08 06:35:04,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:35:04,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:04,282 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:04,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:35:04,283 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:04,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:04,283 INFO L85 PathProgramCache]: Analyzing trace with hash 364881057, now seen corresponding path program 1 times [2025-02-08 06:35:04,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:04,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141805989] [2025-02-08 06:35:04,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:04,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:04,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:35:04,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:35:04,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:04,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:04,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141805989] [2025-02-08 06:35:04,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141805989] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:04,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304495143] [2025-02-08 06:35:04,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:04,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:04,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:04,824 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:04,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:35:04,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:35:04,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:35:04,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:04,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:04,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-02-08 06:35:04,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:04,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:04,924 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-02-08 06:35:04,931 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-02-08 06:35:04,960 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 19 treesize of output 18 [2025-02-08 06:35:04,971 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 19 treesize of output 18 [2025-02-08 06:35:05,185 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-02-08 06:35:05,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:05,228 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 16 [2025-02-08 06:35:05,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:05,232 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 16 [2025-02-08 06:35:05,241 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:05,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:05,348 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-02-08 06:35:05,348 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 3 case distinctions, treesize of input 34 treesize of output 31 [2025-02-08 06:35:05,374 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-02-08 06:35:05,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2025-02-08 06:35:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:05,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:05,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304495143] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:05,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:05,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2025-02-08 06:35:05,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931179798] [2025-02-08 06:35:05,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:05,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:35:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:05,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:35:05,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=837, Unknown=1, NotChecked=58, Total=992 [2025-02-08 06:35:05,861 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand has 28 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 24 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:06,496 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2025-02-08 06:35:06,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:35:06,496 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 24 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-02-08 06:35:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:06,497 INFO L225 Difference]: With dead ends: 121 [2025-02-08 06:35:06,498 INFO L226 Difference]: Without dead ends: 121 [2025-02-08 06:35:06,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=164, Invalid=1479, Unknown=1, NotChecked=78, Total=1722 [2025-02-08 06:35:06,499 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 22 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:06,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 886 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 507 Invalid, 0 Unknown, 102 Unchecked, 0.3s Time] [2025-02-08 06:35:06,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-08 06:35:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-02-08 06:35:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 111 states have internal predecessors, (129), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:35:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2025-02-08 06:35:06,503 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 28 [2025-02-08 06:35:06,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:06,504 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2025-02-08 06:35:06,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 24 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2025-02-08 06:35:06,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:35:06,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:06,505 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:06,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:06,705 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-02-08 06:35:06,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:06,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1573594044, now seen corresponding path program 1 times [2025-02-08 06:35:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:06,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333099035] [2025-02-08 06:35:06,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:06,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:06,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:35:06,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:35:06,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:06,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:06,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:06,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333099035] [2025-02-08 06:35:06,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333099035] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:06,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:06,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:35:06,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614222015] [2025-02-08 06:35:06,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:06,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:35:06,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:06,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:35:06,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:35:06,767 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:06,881 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2025-02-08 06:35:06,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:06,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-02-08 06:35:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:06,883 INFO L225 Difference]: With dead ends: 145 [2025-02-08 06:35:06,883 INFO L226 Difference]: Without dead ends: 145 [2025-02-08 06:35:06,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:06,884 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 53 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:06,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 220 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-08 06:35:06,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 128. [2025-02-08 06:35:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 118 states have internal predecessors, (144), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:35:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2025-02-08 06:35:06,888 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 29 [2025-02-08 06:35:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:06,888 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2025-02-08 06:35:06,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2025-02-08 06:35:06,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:35:06,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:06,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:06,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:35:06,889 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:06,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1573594043, now seen corresponding path program 1 times [2025-02-08 06:35:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829467553] [2025-02-08 06:35:06,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:06,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:06,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:35:06,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:35:06,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:06,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:07,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829467553] [2025-02-08 06:35:07,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829467553] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:07,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429509502] [2025-02-08 06:35:07,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:07,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:07,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:07,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:07,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:35:07,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:35:07,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:35:07,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:07,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:07,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 06:35:07,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:07,285 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:35:07,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429509502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:07,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:35:07,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 16 [2025-02-08 06:35:07,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277510605] [2025-02-08 06:35:07,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:07,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:35:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:07,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:35:07,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-02-08 06:35:07,287 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:07,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:07,433 INFO L93 Difference]: Finished difference Result 156 states and 192 transitions. [2025-02-08 06:35:07,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:35:07,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-02-08 06:35:07,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:07,435 INFO L225 Difference]: With dead ends: 156 [2025-02-08 06:35:07,435 INFO L226 Difference]: Without dead ends: 156 [2025-02-08 06:35:07,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-02-08 06:35:07,436 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:07,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 413 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-08 06:35:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 145. [2025-02-08 06:35:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.5625) internal successors, (175), 135 states have internal predecessors, (175), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:35:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 189 transitions. [2025-02-08 06:35:07,442 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 189 transitions. Word has length 29 [2025-02-08 06:35:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:07,443 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 189 transitions. [2025-02-08 06:35:07,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 189 transitions. [2025-02-08 06:35:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:35:07,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:07,444 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:07,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:35:07,644 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,SelfDestructingSolverStorable13 [2025-02-08 06:35:07,645 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:07,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1536774943, now seen corresponding path program 1 times [2025-02-08 06:35:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:07,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237745667] [2025-02-08 06:35:07,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:07,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:35:07,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:35:07,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:07,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:07,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237745667] [2025-02-08 06:35:07,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237745667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:07,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:07,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:35:07,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029613039] [2025-02-08 06:35:07,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:07,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:35:07,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:07,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:35:07,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:07,710 INFO L87 Difference]: Start difference. First operand 145 states and 189 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:07,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:07,760 INFO L93 Difference]: Finished difference Result 152 states and 193 transitions. [2025-02-08 06:35:07,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:07,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2025-02-08 06:35:07,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:07,761 INFO L225 Difference]: With dead ends: 152 [2025-02-08 06:35:07,762 INFO L226 Difference]: Without dead ends: 152 [2025-02-08 06:35:07,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:07,762 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:07,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 424 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:35:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-08 06:35:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2025-02-08 06:35:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 136 states have internal predecessors, (170), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:35:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2025-02-08 06:35:07,768 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 30 [2025-02-08 06:35:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:07,768 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2025-02-08 06:35:07,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2025-02-08 06:35:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:35:07,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:07,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:07,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:35:07,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:07,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1570375197, now seen corresponding path program 1 times [2025-02-08 06:35:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890892839] [2025-02-08 06:35:07,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:07,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:35:07,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:35:07,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:07,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:08,072 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:08,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890892839] [2025-02-08 06:35:08,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890892839] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:08,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758451823] [2025-02-08 06:35:08,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:08,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:08,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:08,075 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:08,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:35:08,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:35:08,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:35:08,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:08,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:08,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 06:35:08,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:08,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:35:08,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:08,317 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:08,318 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-02-08 06:35:08,338 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:35:08,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:35:08,438 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-02-08 06:35:08,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:08,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:08,478 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 06:35:08,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-08 06:35:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-02-08 06:35:08,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758451823] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:08,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2025-02-08 06:35:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532652800] [2025-02-08 06:35:08,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:08,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:35:08,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:08,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:35:08,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=471, Unknown=1, NotChecked=44, Total=600 [2025-02-08 06:35:08,607 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 19 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:35:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:08,957 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2025-02-08 06:35:08,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:35:08,957 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 19 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 32 [2025-02-08 06:35:08,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:08,958 INFO L225 Difference]: With dead ends: 147 [2025-02-08 06:35:08,958 INFO L226 Difference]: Without dead ends: 147 [2025-02-08 06:35:08,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=642, Unknown=1, NotChecked=52, Total=812 [2025-02-08 06:35:08,959 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:08,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 393 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 430 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2025-02-08 06:35:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-02-08 06:35:08,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2025-02-08 06:35:08,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 129 states have internal predecessors, (158), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:08,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 170 transitions. [2025-02-08 06:35:08,962 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 170 transitions. Word has length 32 [2025-02-08 06:35:08,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:08,963 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 170 transitions. [2025-02-08 06:35:08,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 19 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:35:08,963 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 170 transitions. [2025-02-08 06:35:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:35:08,963 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:08,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:08,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:09,168 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,SelfDestructingSolverStorable15 [2025-02-08 06:35:09,168 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:09,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:09,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2049119696, now seen corresponding path program 1 times [2025-02-08 06:35:09,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:09,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140189605] [2025-02-08 06:35:09,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:09,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:35:09,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:35:09,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:09,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140189605] [2025-02-08 06:35:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140189605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:35:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819295837] [2025-02-08 06:35:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:09,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:09,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:09,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:09,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:09,240 INFO L87 Difference]: Start difference. First operand 138 states and 170 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:35:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:09,326 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2025-02-08 06:35:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-02-08 06:35:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:09,327 INFO L225 Difference]: With dead ends: 137 [2025-02-08 06:35:09,327 INFO L226 Difference]: Without dead ends: 137 [2025-02-08 06:35:09,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:09,328 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:09,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 317 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:09,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-08 06:35:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-08 06:35:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 107 states have (on average 1.4579439252336448) internal successors, (156), 128 states have internal predecessors, (156), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 168 transitions. [2025-02-08 06:35:09,350 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 168 transitions. Word has length 33 [2025-02-08 06:35:09,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:09,350 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 168 transitions. [2025-02-08 06:35:09,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:35:09,350 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 168 transitions. [2025-02-08 06:35:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:35:09,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:09,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:09,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:35:09,352 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:09,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2049119697, now seen corresponding path program 1 times [2025-02-08 06:35:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:09,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351817974] [2025-02-08 06:35:09,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:09,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:35:09,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:35:09,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:09,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:09,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351817974] [2025-02-08 06:35:09,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351817974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:09,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:09,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:35:09,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348317770] [2025-02-08 06:35:09,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:09,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:35:09,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:09,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:35:09,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:35:09,480 INFO L87 Difference]: Start difference. First operand 137 states and 168 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:35:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:09,574 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2025-02-08 06:35:09,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:35:09,574 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2025-02-08 06:35:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:09,575 INFO L225 Difference]: With dead ends: 136 [2025-02-08 06:35:09,575 INFO L226 Difference]: Without dead ends: 136 [2025-02-08 06:35:09,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:09,575 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:09,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 330 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-08 06:35:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-02-08 06:35:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 107 states have (on average 1.439252336448598) internal successors, (154), 127 states have internal predecessors, (154), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:09,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 166 transitions. [2025-02-08 06:35:09,580 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 166 transitions. Word has length 33 [2025-02-08 06:35:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:09,581 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 166 transitions. [2025-02-08 06:35:09,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:35:09,581 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 166 transitions. [2025-02-08 06:35:09,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:35:09,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:09,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:09,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 06:35:09,582 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:09,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:09,583 INFO L85 PathProgramCache]: Analyzing trace with hash 627875966, now seen corresponding path program 1 times [2025-02-08 06:35:09,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:09,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629952611] [2025-02-08 06:35:09,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:09,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:35:09,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:35:09,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:10,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:10,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629952611] [2025-02-08 06:35:10,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629952611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:10,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:10,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-02-08 06:35:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236810576] [2025-02-08 06:35:10,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:10,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:35:10,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:10,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:35:10,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:35:10,247 INFO L87 Difference]: Start difference. First operand 136 states and 166 transitions. Second operand has 21 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:10,763 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2025-02-08 06:35:10,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 06:35:10,763 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-02-08 06:35:10,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:10,764 INFO L225 Difference]: With dead ends: 151 [2025-02-08 06:35:10,764 INFO L226 Difference]: Without dead ends: 151 [2025-02-08 06:35:10,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2025-02-08 06:35:10,765 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 33 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:10,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 580 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:35:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-08 06:35:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2025-02-08 06:35:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.3983050847457628) internal successors, (165), 137 states have internal predecessors, (165), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:10,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 177 transitions. [2025-02-08 06:35:10,770 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 177 transitions. Word has length 32 [2025-02-08 06:35:10,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:10,770 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 177 transitions. [2025-02-08 06:35:10,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:10,770 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 177 transitions. [2025-02-08 06:35:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 06:35:10,771 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:10,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:10,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:35:10,771 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:10,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash 627875967, now seen corresponding path program 1 times [2025-02-08 06:35:10,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:10,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122636958] [2025-02-08 06:35:10,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:10,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:10,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-08 06:35:10,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-08 06:35:10,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:10,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:11,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:11,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122636958] [2025-02-08 06:35:11,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122636958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:11,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:11,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 06:35:11,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230536443] [2025-02-08 06:35:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:11,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:35:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:11,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:35:11,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:35:11,158 INFO L87 Difference]: Start difference. First operand 146 states and 177 transitions. Second operand has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:11,437 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2025-02-08 06:35:11,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:35:11,437 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2025-02-08 06:35:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:11,438 INFO L225 Difference]: With dead ends: 161 [2025-02-08 06:35:11,438 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 06:35:11,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:35:11,439 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 50 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:11,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 550 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 06:35:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 154. [2025-02-08 06:35:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 126 states have (on average 1.4126984126984128) internal successors, (178), 145 states have internal predecessors, (178), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 190 transitions. [2025-02-08 06:35:11,442 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 190 transitions. Word has length 32 [2025-02-08 06:35:11,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:11,443 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 190 transitions. [2025-02-08 06:35:11,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 190 transitions. [2025-02-08 06:35:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:35:11,443 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:11,443 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:11,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:35:11,444 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:11,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash 268138156, now seen corresponding path program 1 times [2025-02-08 06:35:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:11,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529450333] [2025-02-08 06:35:11,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:11,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:35:11,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:35:11,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:11,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:11,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:11,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529450333] [2025-02-08 06:35:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529450333] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:11,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001298931] [2025-02-08 06:35:11,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:11,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:11,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:11,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:11,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:35:11,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:35:11,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:35:11,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:11,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:11,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-08 06:35:11,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:11,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:11,696 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-02-08 06:35:11,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 06:35:11,713 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2025-02-08 06:35:11,728 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:35:11,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 06:35:11,737 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-02-08 06:35:11,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:11,823 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:11,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001298931] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:11,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:11,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-02-08 06:35:11,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071417455] [2025-02-08 06:35:11,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:11,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:35:11,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:11,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:35:11,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-02-08 06:35:11,825 INFO L87 Difference]: Start difference. First operand 154 states and 190 transitions. Second operand has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 06:35:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:12,016 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2025-02-08 06:35:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:35:12,017 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2025-02-08 06:35:12,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:12,017 INFO L225 Difference]: With dead ends: 153 [2025-02-08 06:35:12,018 INFO L226 Difference]: Without dead ends: 153 [2025-02-08 06:35:12,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2025-02-08 06:35:12,018 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 11 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:12,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 450 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 83 Unchecked, 0.1s Time] [2025-02-08 06:35:12,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-08 06:35:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-02-08 06:35:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 144 states have internal predecessors, (177), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 189 transitions. [2025-02-08 06:35:12,024 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 189 transitions. Word has length 37 [2025-02-08 06:35:12,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:12,024 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 189 transitions. [2025-02-08 06:35:12,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 2 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 06:35:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 189 transitions. [2025-02-08 06:35:12,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-08 06:35:12,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:12,025 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:12,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:12,230 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,SelfDestructingSolverStorable20 [2025-02-08 06:35:12,230 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:12,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash 268138157, now seen corresponding path program 1 times [2025-02-08 06:35:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:12,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875695158] [2025-02-08 06:35:12,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:12,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:12,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:35:12,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:35:12,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:12,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:12,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:12,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875695158] [2025-02-08 06:35:12,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875695158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:12,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382932818] [2025-02-08 06:35:12,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:12,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:12,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:12,430 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:12,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:35:12,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-08 06:35:12,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-08 06:35:12,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:12,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:12,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 06:35:12,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:12,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:35:12,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:12,578 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-02-08 06:35:12,583 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-02-08 06:35:12,607 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 26 treesize of output 14 [2025-02-08 06:35:12,671 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-02-08 06:35:12,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:12,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:12,691 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:12,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:12,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-02-08 06:35:12,708 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382932818] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:12,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:12,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-02-08 06:35:12,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973954617] [2025-02-08 06:35:12,785 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:12,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:35:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:12,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:35:12,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=372, Unknown=1, NotChecked=38, Total=462 [2025-02-08 06:35:12,786 INFO L87 Difference]: Start difference. First operand 153 states and 189 transitions. Second operand has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:35:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,146 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2025-02-08 06:35:13,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:35:13,146 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2025-02-08 06:35:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,147 INFO L225 Difference]: With dead ends: 151 [2025-02-08 06:35:13,147 INFO L226 Difference]: Without dead ends: 151 [2025-02-08 06:35:13,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=715, Unknown=1, NotChecked=54, Total=870 [2025-02-08 06:35:13,148 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 5 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 753 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 508 Invalid, 0 Unknown, 83 Unchecked, 0.2s Time] [2025-02-08 06:35:13,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-08 06:35:13,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 147. [2025-02-08 06:35:13,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.3983739837398375) internal successors, (172), 139 states have internal predecessors, (172), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:35:13,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 182 transitions. [2025-02-08 06:35:13,152 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 182 transitions. Word has length 37 [2025-02-08 06:35:13,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,152 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 182 transitions. [2025-02-08 06:35:13,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 15 states have internal predecessors, (44), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2025-02-08 06:35:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 182 transitions. [2025-02-08 06:35:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:35:13,152 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,152 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:13,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:13,353 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:13,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,354 INFO L85 PathProgramCache]: Analyzing trace with hash 470328960, now seen corresponding path program 1 times [2025-02-08 06:35:13,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58239353] [2025-02-08 06:35:13,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:13,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:13,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:13,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58239353] [2025-02-08 06:35:13,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58239353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:13,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:13,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-08 06:35:13,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932456127] [2025-02-08 06:35:13,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-08 06:35:13,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-08 06:35:13,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2025-02-08 06:35:13,631 INFO L87 Difference]: Start difference. First operand 147 states and 182 transitions. Second operand has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,842 INFO L93 Difference]: Finished difference Result 161 states and 193 transitions. [2025-02-08 06:35:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:35:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2025-02-08 06:35:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,843 INFO L225 Difference]: With dead ends: 161 [2025-02-08 06:35:13,843 INFO L226 Difference]: Without dead ends: 161 [2025-02-08 06:35:13,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:35:13,843 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 55 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 517 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:13,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-08 06:35:13,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 152. [2025-02-08 06:35:13,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 128 states have (on average 1.40625) internal successors, (180), 144 states have internal predecessors, (180), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:35:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 190 transitions. [2025-02-08 06:35:13,847 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 190 transitions. Word has length 35 [2025-02-08 06:35:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,847 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 190 transitions. [2025-02-08 06:35:13,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 190 transitions. [2025-02-08 06:35:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 06:35:13,848 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:35:13,848 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1371725885, now seen corresponding path program 1 times [2025-02-08 06:35:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365360134] [2025-02-08 06:35:13,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 06:35:13,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 06:35:13,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365360134] [2025-02-08 06:35:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365360134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:13,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:13,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:35:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559832882] [2025-02-08 06:35:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:35:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:35:13,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:13,916 INFO L87 Difference]: Start difference. First operand 152 states and 190 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:13,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,996 INFO L93 Difference]: Finished difference Result 157 states and 197 transitions. [2025-02-08 06:35:13,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:35:13,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-02-08 06:35:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,997 INFO L225 Difference]: With dead ends: 157 [2025-02-08 06:35:13,997 INFO L226 Difference]: Without dead ends: 157 [2025-02-08 06:35:13,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:35:13,998 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 31 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 324 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-08 06:35:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2025-02-08 06:35:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.4166666666666667) internal successors, (187), 148 states have internal predecessors, (187), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:35:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2025-02-08 06:35:14,002 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 197 transitions. Word has length 36 [2025-02-08 06:35:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:14,003 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 197 transitions. [2025-02-08 06:35:14,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 197 transitions. [2025-02-08 06:35:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-08 06:35:14,004 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:14,004 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:14,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 06:35:14,004 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:14,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1386722167, now seen corresponding path program 1 times [2025-02-08 06:35:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:14,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518348181] [2025-02-08 06:35:14,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:14,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:14,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-08 06:35:14,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-08 06:35:14,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:14,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:14,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:14,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518348181] [2025-02-08 06:35:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518348181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:14,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:35:14,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-02-08 06:35:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489489329] [2025-02-08 06:35:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:14,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 06:35:14,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:14,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 06:35:14,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:35:14,680 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:15,277 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2025-02-08 06:35:15,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 06:35:15,277 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2025-02-08 06:35:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:15,278 INFO L225 Difference]: With dead ends: 154 [2025-02-08 06:35:15,278 INFO L226 Difference]: Without dead ends: 154 [2025-02-08 06:35:15,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 06:35:15,278 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 23 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:15,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 760 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:35:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-08 06:35:15,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2025-02-08 06:35:15,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 128 states have (on average 1.390625) internal successors, (178), 144 states have internal predecessors, (178), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-08 06:35:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 188 transitions. [2025-02-08 06:35:15,282 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 188 transitions. Word has length 38 [2025-02-08 06:35:15,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:15,282 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 188 transitions. [2025-02-08 06:35:15,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 22 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:15,282 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2025-02-08 06:35:15,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:35:15,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:15,282 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:15,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 06:35:15,282 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:15,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash -690662500, now seen corresponding path program 1 times [2025-02-08 06:35:15,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:15,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038122040] [2025-02-08 06:35:15,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:15,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:15,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:15,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:15,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:16,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:16,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038122040] [2025-02-08 06:35:16,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038122040] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:16,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829391470] [2025-02-08 06:35:16,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:16,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:16,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:16,046 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:16,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:35:16,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:16,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:16,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:16,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:16,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-08 06:35:16,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:16,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:16,179 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-02-08 06:35:16,183 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-02-08 06:35:16,192 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 19 treesize of output 18 [2025-02-08 06:35:16,199 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 19 treesize of output 18 [2025-02-08 06:35:16,445 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:16,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:16,457 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~sll~1#1.base|))) (and (= (select .cse0 8) 0) (= |c_ULTIMATE.start_create_~sll~1#1.base| |c_ULTIMATE.start_create_~now~1#1.base|) (or (let ((.cse1 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~sll~1#1.base|))) (and (= (select .cse1 0) 0) (= (select .cse1 8) 0))) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| |c_ULTIMATE.start_create_~sll~1#1.base|)) (.cse3 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#0.offset|))) (and (= (select .cse2 0) 0) (= (select .cse2 8) 0) (= (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#0.offset| .cse3)) |c_#memory_$Pointer$#0.offset|) (= .cse3 |c_ULTIMATE.start_create_internal_#t~ret5#1.base|))))) (not (= |c_ULTIMATE.start_create_~sll~1#1.base| |c_ULTIMATE.start_create_internal_#t~ret5#1.base|)) (<= |c_ULTIMATE.start_create_~sll~1#1.offset| 0) (= (select .cse0 0) 0) (<= |c_ULTIMATE.start_create_~sll~1#1.offset| |c_ULTIMATE.start_create_~now~1#1.offset|))) is different from false [2025-02-08 06:35:16,459 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~sll~1#1.base|))) (and (= (select .cse0 8) 0) (= |c_ULTIMATE.start_create_~sll~1#1.base| |c_ULTIMATE.start_create_~now~1#1.base|) (or (let ((.cse1 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~sll~1#1.base|))) (and (= (select .cse1 0) 0) (= (select .cse1 8) 0))) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse2 (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| |c_ULTIMATE.start_create_~sll~1#1.base|)) (.cse3 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#0.offset|))) (and (= (select .cse2 0) 0) (= (select .cse2 8) 0) (= (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| .cse3 (select |c_#memory_$Pointer$#0.offset| .cse3)) |c_#memory_$Pointer$#0.offset|) (= .cse3 |c_ULTIMATE.start_create_internal_#t~ret5#1.base|))))) (not (= |c_ULTIMATE.start_create_~sll~1#1.base| |c_ULTIMATE.start_create_internal_#t~ret5#1.base|)) (<= |c_ULTIMATE.start_create_~sll~1#1.offset| 0) (= (select .cse0 0) 0) (<= |c_ULTIMATE.start_create_~sll~1#1.offset| |c_ULTIMATE.start_create_~now~1#1.offset|))) is different from true [2025-02-08 06:35:16,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:35:16,579 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (<= (select |c_#length| alloc_and_zero_internal_~pi~1.base) 8) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_internal_~pi~1.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-02-08 06:35:16,606 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:16,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2025-02-08 06:35:16,625 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:16,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 20 [2025-02-08 06:35:16,713 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 42 [2025-02-08 06:35:16,718 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 42 [2025-02-08 06:35:16,918 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-02-08 06:35:16,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 57 [2025-02-08 06:35:16,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:16,927 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 40 treesize of output 42 [2025-02-08 06:35:16,950 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2025-02-08 06:35:16,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 45 [2025-02-08 06:35:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-08 06:35:17,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:17,610 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 20 [2025-02-08 06:35:17,672 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~1#1.offset| 8))) (and (forall ((v_alloc_and_zero_internal_~pi~1.base_41 Int)) (or (forall ((v_ArrVal_808 (Array Int Int)) (|ULTIMATE.start_create_~shared~0#1.offset| Int) (v_ArrVal_797 (Array Int Int)) (|v_ULTIMATE.start_loop_~x#1.offset_14| Int)) (or (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#0.offset| v_alloc_and_zero_internal_~pi~1.base_41 v_ArrVal_808) |c_ULTIMATE.start_create_internal_~now~0#1.base| v_ArrVal_797))) (store .cse0 |c_ULTIMATE.start_create_~now~1#1.base| (store (select .cse0 |c_ULTIMATE.start_create_~now~1#1.base|) .cse1 |ULTIMATE.start_create_~shared~0#1.offset|))) |c_ULTIMATE.start_create_~sll~1#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_14|) 0) (< |c_ULTIMATE.start_create_~sll~1#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_14|) (< |v_ULTIMATE.start_loop_~x#1.offset_14| 0))) (= v_alloc_and_zero_internal_~pi~1.base_41 |c_ULTIMATE.start_create_~now~1#1.base|))) (or (< 0 .cse1) (and (forall ((v_alloc_and_zero_internal_~pi~1.base_41 Int) (v_ArrVal_808 (Array Int Int)) (|ULTIMATE.start_create_~shared~0#1.offset| Int) (v_ArrVal_797 (Array Int Int)) (|v_ULTIMATE.start_loop_~x#1.offset_14| Int)) (or (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#0.offset| v_alloc_and_zero_internal_~pi~1.base_41 v_ArrVal_808) |c_ULTIMATE.start_create_internal_~now~0#1.base| v_ArrVal_797))) (store .cse2 |c_ULTIMATE.start_create_~now~1#1.base| (store (select .cse2 |c_ULTIMATE.start_create_~now~1#1.base|) .cse1 |ULTIMATE.start_create_~shared~0#1.offset|))) |c_ULTIMATE.start_create_~sll~1#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_14|) 0) (< |c_ULTIMATE.start_create_~sll~1#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_14|) (< |v_ULTIMATE.start_loop_~x#1.offset_14| 0))) (forall ((v_alloc_and_zero_internal_~pi~1.base_41 Int) (v_ArrVal_809 (Array Int Int)) (|v_ULTIMATE.start_loop_~x#1.offset_14| Int) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_798 Int)) (or (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#0.base| v_alloc_and_zero_internal_~pi~1.base_41 v_ArrVal_809) |c_ULTIMATE.start_create_internal_~now~0#1.base| v_ArrVal_796))) (store .cse3 |c_ULTIMATE.start_create_~now~1#1.base| (store (select .cse3 |c_ULTIMATE.start_create_~now~1#1.base|) .cse1 v_ArrVal_798))) |c_ULTIMATE.start_create_~sll~1#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_14|) 0) (< |c_ULTIMATE.start_create_~sll~1#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_14|) (< |v_ULTIMATE.start_loop_~x#1.offset_14| 0))))) (forall ((v_alloc_and_zero_internal_~pi~1.base_41 Int)) (or (= v_alloc_and_zero_internal_~pi~1.base_41 |c_ULTIMATE.start_create_~now~1#1.base|) (forall ((v_ArrVal_809 (Array Int Int)) (|v_ULTIMATE.start_loop_~x#1.offset_14| Int) (v_ArrVal_796 (Array Int Int)) (v_ArrVal_798 Int)) (or (= (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$#0.base| v_alloc_and_zero_internal_~pi~1.base_41 v_ArrVal_809) |c_ULTIMATE.start_create_internal_~now~0#1.base| v_ArrVal_796))) (store .cse4 |c_ULTIMATE.start_create_~now~1#1.base| (store (select .cse4 |c_ULTIMATE.start_create_~now~1#1.base|) .cse1 v_ArrVal_798))) |c_ULTIMATE.start_create_~sll~1#1.base|) |v_ULTIMATE.start_loop_~x#1.offset_14|) 0) (< |c_ULTIMATE.start_create_~sll~1#1.offset| |v_ULTIMATE.start_loop_~x#1.offset_14|) (< |v_ULTIMATE.start_loop_~x#1.offset_14| 0))))))) is different from false [2025-02-08 06:35:17,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829391470] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:17,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:17,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 36 [2025-02-08 06:35:17,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415288994] [2025-02-08 06:35:17,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:17,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:35:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:17,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:35:17,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1293, Unknown=5, NotChecked=222, Total=1640 [2025-02-08 06:35:17,676 INFO L87 Difference]: Start difference. First operand 152 states and 188 transitions. Second operand has 36 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 28 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:18,030 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~sll~1#1.base|)) (.cse6 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~sll~1#1.base|))) (let ((.cse0 (= (select .cse6 8) 0)) (.cse2 (= (select .cse7 8) 0)) (.cse1 (= (select .cse7 0) 0)) (.cse5 (= (select .cse6 0) 0))) (and .cse0 (= |c_ULTIMATE.start_create_~sll~1#1.base| |c_ULTIMATE.start_create_~now~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base|) |c_ULTIMATE.start_create_~sll~1#1.offset|) 0) (or (and .cse1 .cse2) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| |c_ULTIMATE.start_create_~sll~1#1.base|)) (.cse4 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#0.offset|))) (and (= (select .cse3 0) 0) (= (select .cse3 8) 0) (= (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#0.offset| .cse4)) |c_#memory_$Pointer$#0.offset|) (= .cse4 |c_ULTIMATE.start_create_internal_#t~ret5#1.base|))))) (not (= 8 |c_ULTIMATE.start_create_~sll~1#1.offset|)) (not (= |c_ULTIMATE.start_create_~sll~1#1.base| |c_ULTIMATE.start_create_internal_#t~ret5#1.base|)) (= |c_ULTIMATE.start_create_~now~1#1.offset| 0) (or (< (select |c_#length| |c_ULTIMATE.start_create_~sll~1#1.base|) 9) (and .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (<= (select |c_#length| alloc_and_zero_internal_~pi~1.base) 8)) .cse1 .cse2 .cse5)) (<= |c_ULTIMATE.start_create_~sll~1#1.offset| 0) (not (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (or (< (+ 7 |c_ULTIMATE.start_create_~sll~1#1.offset|) 0) (and .cse1 .cse5)) .cse5 (<= |c_ULTIMATE.start_create_~sll~1#1.offset| |c_ULTIMATE.start_create_~now~1#1.offset|) (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base|) |c_ULTIMATE.start_create_~sll~1#1.offset|) 0)))) is different from false [2025-02-08 06:35:18,032 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~sll~1#1.base|)) (.cse6 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~sll~1#1.base|))) (let ((.cse0 (= (select .cse6 8) 0)) (.cse2 (= (select .cse7 8) 0)) (.cse1 (= (select .cse7 0) 0)) (.cse5 (= (select .cse6 0) 0))) (and .cse0 (= |c_ULTIMATE.start_create_~sll~1#1.base| |c_ULTIMATE.start_create_~now~1#1.base|) (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base|) |c_ULTIMATE.start_create_~sll~1#1.offset|) 0) (or (and .cse1 .cse2) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| |c_ULTIMATE.start_create_~sll~1#1.base|)) (.cse4 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| |c_#memory_$Pointer$#0.offset|))) (and (= (select .cse3 0) 0) (= (select .cse3 8) 0) (= (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_4| .cse4 (select |c_#memory_$Pointer$#0.offset| .cse4)) |c_#memory_$Pointer$#0.offset|) (= .cse4 |c_ULTIMATE.start_create_internal_#t~ret5#1.base|))))) (not (= 8 |c_ULTIMATE.start_create_~sll~1#1.offset|)) (not (= |c_ULTIMATE.start_create_~sll~1#1.base| |c_ULTIMATE.start_create_internal_#t~ret5#1.base|)) (= |c_ULTIMATE.start_create_~now~1#1.offset| 0) (or (< (select |c_#length| |c_ULTIMATE.start_create_~sll~1#1.base|) 9) (and .cse0 (exists ((alloc_and_zero_internal_~pi~1.base Int)) (<= (select |c_#length| alloc_and_zero_internal_~pi~1.base) 8)) .cse1 .cse2 .cse5)) (<= |c_ULTIMATE.start_create_~sll~1#1.offset| 0) (not (= |c_ULTIMATE.start_create_internal_#t~ret5#1.base| |c_ULTIMATE.start_create_~now~1#1.base|)) (or (< (+ 7 |c_ULTIMATE.start_create_~sll~1#1.offset|) 0) (and .cse1 .cse5)) .cse5 (<= |c_ULTIMATE.start_create_~sll~1#1.offset| |c_ULTIMATE.start_create_~now~1#1.offset|) (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base|) |c_ULTIMATE.start_create_~sll~1#1.offset|) 0)))) is different from true [2025-02-08 06:35:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:18,573 INFO L93 Difference]: Finished difference Result 170 states and 211 transitions. [2025-02-08 06:35:18,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:35:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 28 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2025-02-08 06:35:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:18,575 INFO L225 Difference]: With dead ends: 170 [2025-02-08 06:35:18,575 INFO L226 Difference]: Without dead ends: 170 [2025-02-08 06:35:18,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=2346, Unknown=7, NotChecked=404, Total=2970 [2025-02-08 06:35:18,576 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 15 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:18,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1109 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 875 Invalid, 0 Unknown, 239 Unchecked, 0.4s Time] [2025-02-08 06:35:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-02-08 06:35:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2025-02-08 06:35:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 159 states have internal predecessors, (195), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2025-02-08 06:35:18,579 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 40 [2025-02-08 06:35:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:18,580 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2025-02-08 06:35:18,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 28 states have internal predecessors, (60), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:18,580 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2025-02-08 06:35:18,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:35:18,580 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:18,580 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:18,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-08 06:35:18,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 06:35:18,785 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:18,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 38703356, now seen corresponding path program 1 times [2025-02-08 06:35:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:18,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849004017] [2025-02-08 06:35:18,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:18,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:18,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:35:18,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:35:18,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:18,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:19,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:19,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849004017] [2025-02-08 06:35:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849004017] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:19,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16348880] [2025-02-08 06:35:19,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:19,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:19,142 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:19,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:35:19,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:35:19,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:35:19,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:19,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:19,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-08 06:35:19,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:19,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:19,331 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:19,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:19,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:35:19,470 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-02-08 06:35:19,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:19,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:19,531 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 6 treesize of output 4 [2025-02-08 06:35:19,545 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 32 treesize of output 26 [2025-02-08 06:35:19,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16348880] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:19,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:19,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 28 [2025-02-08 06:35:19,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164655325] [2025-02-08 06:35:19,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:19,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:35:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:19,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:35:19,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:35:19,612 INFO L87 Difference]: Start difference. First operand 168 states and 207 transitions. Second operand has 29 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:20,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:20,035 INFO L93 Difference]: Finished difference Result 199 states and 232 transitions. [2025-02-08 06:35:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:35:20,036 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2025-02-08 06:35:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:20,037 INFO L225 Difference]: With dead ends: 199 [2025-02-08 06:35:20,037 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 06:35:20,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 06:35:20,037 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 126 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:20,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 761 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:20,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 06:35:20,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 168. [2025-02-08 06:35:20,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 159 states have internal predecessors, (195), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 207 transitions. [2025-02-08 06:35:20,041 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 207 transitions. Word has length 39 [2025-02-08 06:35:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:20,041 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 207 transitions. [2025-02-08 06:35:20,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 24 states have internal predecessors, (55), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 207 transitions. [2025-02-08 06:35:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:35:20,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:20,042 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:20,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:35:20,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:20,242 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:20,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:20,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1527998962, now seen corresponding path program 1 times [2025-02-08 06:35:20,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:20,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599063051] [2025-02-08 06:35:20,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:20,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:20,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:35:20,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:35:20,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:20,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:20,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599063051] [2025-02-08 06:35:20,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599063051] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:20,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97175414] [2025-02-08 06:35:20,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:20,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:20,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:20,363 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:20,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:35:20,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:35:20,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:35:20,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:20,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:20,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-08 06:35:20,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:20,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:20,633 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:20,634 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 18 treesize of output 16 [2025-02-08 06:35:20,703 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:20,703 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:35:20,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97175414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:35:20,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:35:20,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [9] total 25 [2025-02-08 06:35:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659237905] [2025-02-08 06:35:20,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:35:20,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:35:20,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:20,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:35:20,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:35:20,704 INFO L87 Difference]: Start difference. First operand 168 states and 207 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:20,942 INFO L93 Difference]: Finished difference Result 188 states and 219 transitions. [2025-02-08 06:35:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:35:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-02-08 06:35:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:20,943 INFO L225 Difference]: With dead ends: 188 [2025-02-08 06:35:20,943 INFO L226 Difference]: Without dead ends: 184 [2025-02-08 06:35:20,944 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:35:20,944 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 61 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:20,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 734 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:20,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-08 06:35:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 172. [2025-02-08 06:35:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 147 states have (on average 1.346938775510204) internal successors, (198), 163 states have internal predecessors, (198), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 210 transitions. [2025-02-08 06:35:20,947 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 210 transitions. Word has length 39 [2025-02-08 06:35:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:20,947 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 210 transitions. [2025-02-08 06:35:20,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:20,947 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 210 transitions. [2025-02-08 06:35:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 06:35:20,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:20,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:20,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:21,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 06:35:21,148 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1224000789, now seen corresponding path program 1 times [2025-02-08 06:35:21,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:21,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939921879] [2025-02-08 06:35:21,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:21,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:21,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:35:21,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:35:21,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:21,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:21,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939921879] [2025-02-08 06:35:21,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939921879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:21,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790128155] [2025-02-08 06:35:21,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:21,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:21,268 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:21,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:35:21,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 06:35:21,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 06:35:21,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:21,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:21,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 06:35:21,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:35:21,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:21,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:21,476 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 19 treesize of output 23 [2025-02-08 06:35:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:35:21,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790128155] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:21,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:21,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 12 [2025-02-08 06:35:21,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682144229] [2025-02-08 06:35:21,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:21,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:35:21,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:21,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:35:21,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:35:21,549 INFO L87 Difference]: Start difference. First operand 172 states and 210 transitions. Second operand has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 06:35:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:21,638 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2025-02-08 06:35:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:35:21,638 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 41 [2025-02-08 06:35:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:21,639 INFO L225 Difference]: With dead ends: 173 [2025-02-08 06:35:21,639 INFO L226 Difference]: Without dead ends: 173 [2025-02-08 06:35:21,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:35:21,640 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 15 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:21,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 446 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-02-08 06:35:21,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2025-02-08 06:35:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 147 states have (on average 1.3401360544217686) internal successors, (197), 163 states have internal predecessors, (197), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:21,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 209 transitions. [2025-02-08 06:35:21,643 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 209 transitions. Word has length 41 [2025-02-08 06:35:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:21,643 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 209 transitions. [2025-02-08 06:35:21,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 4 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-02-08 06:35:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 209 transitions. [2025-02-08 06:35:21,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:35:21,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:21,644 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:21,650 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-02-08 06:35:21,844 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,SelfDestructingSolverStorable28 [2025-02-08 06:35:21,845 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:21,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:21,845 INFO L85 PathProgramCache]: Analyzing trace with hash -171156999, now seen corresponding path program 1 times [2025-02-08 06:35:21,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:21,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303127186] [2025-02-08 06:35:21,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:21,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:21,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:35:21,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:35:21,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:21,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 06:35:22,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:22,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303127186] [2025-02-08 06:35:22,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303127186] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:22,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377396038] [2025-02-08 06:35:22,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:22,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:22,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:22,103 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:22,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:35:22,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:35:22,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:35:22,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:22,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:22,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 06:35:22,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:22,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:22,326 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2025-02-08 06:35:22,348 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:35:22,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:35:22,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:35:22,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 06:35:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-02-08 06:35:22,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:22,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-02-08 06:35:22,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377396038] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:22,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:22,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 27 [2025-02-08 06:35:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724505271] [2025-02-08 06:35:22,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:22,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:35:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:22,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:35:22,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1020, Unknown=1, NotChecked=64, Total=1190 [2025-02-08 06:35:22,834 INFO L87 Difference]: Start difference. First operand 172 states and 209 transitions. Second operand has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:23,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:23,233 INFO L93 Difference]: Finished difference Result 176 states and 207 transitions. [2025-02-08 06:35:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:35:23,234 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-02-08 06:35:23,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:23,234 INFO L225 Difference]: With dead ends: 176 [2025-02-08 06:35:23,234 INFO L226 Difference]: Without dead ends: 172 [2025-02-08 06:35:23,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=1501, Unknown=1, NotChecked=78, Total=1722 [2025-02-08 06:35:23,235 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 47 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:23,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 752 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 829 Invalid, 0 Unknown, 118 Unchecked, 0.3s Time] [2025-02-08 06:35:23,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-08 06:35:23,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2025-02-08 06:35:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 159 states have internal predecessors, (191), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:23,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 203 transitions. [2025-02-08 06:35:23,239 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 203 transitions. Word has length 44 [2025-02-08 06:35:23,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:23,240 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 203 transitions. [2025-02-08 06:35:23,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.423076923076923) internal successors, (63), 24 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 203 transitions. [2025-02-08 06:35:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:35:23,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:23,242 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:23,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 06:35:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:23,444 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:23,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:23,444 INFO L85 PathProgramCache]: Analyzing trace with hash -171156998, now seen corresponding path program 1 times [2025-02-08 06:35:23,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:23,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368575808] [2025-02-08 06:35:23,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:23,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:23,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:35:23,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:35:23,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:23,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:23,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368575808] [2025-02-08 06:35:23,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368575808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:23,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965363896] [2025-02-08 06:35:23,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:23,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:23,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:23,965 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-02-08 06:35:23,967 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-02-08 06:35:24,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:35:24,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:35:24,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:24,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:24,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-02-08 06:35:24,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:24,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:35:24,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:35:24,332 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 29 treesize of output 17 [2025-02-08 06:35:24,333 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 32 treesize of output 14 [2025-02-08 06:35:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:24,370 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:24,403 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 70 treesize of output 64 [2025-02-08 06:35:24,404 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 94 treesize of output 82 [2025-02-08 06:35:24,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:24,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:24,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:24,459 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 25 treesize of output 29 [2025-02-08 06:35:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:35:24,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965363896] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:24,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:24,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 13] total 33 [2025-02-08 06:35:24,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745315895] [2025-02-08 06:35:24,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:24,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 06:35:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:24,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 06:35:24,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2025-02-08 06:35:24,539 INFO L87 Difference]: Start difference. First operand 168 states and 203 transitions. Second operand has 34 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 30 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:25,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:25,033 INFO L93 Difference]: Finished difference Result 196 states and 236 transitions. [2025-02-08 06:35:25,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:35:25,033 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 30 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-02-08 06:35:25,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:25,034 INFO L225 Difference]: With dead ends: 196 [2025-02-08 06:35:25,034 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 06:35:25,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=1729, Unknown=0, NotChecked=0, Total=1892 [2025-02-08 06:35:25,035 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 95 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:25,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 799 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:25,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 06:35:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2025-02-08 06:35:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 161 states have (on average 1.3416149068322982) internal successors, (216), 177 states have internal predecessors, (216), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 228 transitions. [2025-02-08 06:35:25,039 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 228 transitions. Word has length 44 [2025-02-08 06:35:25,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:25,039 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 228 transitions. [2025-02-08 06:35:25,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 30 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:25,039 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 228 transitions. [2025-02-08 06:35:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:35:25,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:25,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:25,046 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-02-08 06:35:25,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:25,240 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:25,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:25,240 INFO L85 PathProgramCache]: Analyzing trace with hash 64820191, now seen corresponding path program 1 times [2025-02-08 06:35:25,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:25,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777932048] [2025-02-08 06:35:25,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:25,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:35:25,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:35:25,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:25,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777932048] [2025-02-08 06:35:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777932048] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780440830] [2025-02-08 06:35:25,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:25,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:25,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:25,484 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-02-08 06:35:25,486 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-02-08 06:35:25,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:35:25,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:35:25,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:25,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:25,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-08 06:35:25,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:25,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:25,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:25,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:25,842 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:35:25,842 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-02-08 06:35:25,908 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 25 treesize of output 13 [2025-02-08 06:35:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:25,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:25,964 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-02-08 06:35:25,964 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 19 treesize of output 18 [2025-02-08 06:35:26,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:26,012 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 18 treesize of output 19 [2025-02-08 06:35:26,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:26,018 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 30 treesize of output 33 [2025-02-08 06:35:26,025 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-02-08 06:35:26,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780440830] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:26,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:26,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2025-02-08 06:35:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8053550] [2025-02-08 06:35:26,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:26,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 06:35:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:26,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 06:35:26,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=955, Unknown=2, NotChecked=0, Total=1056 [2025-02-08 06:35:26,086 INFO L87 Difference]: Start difference. First operand 186 states and 228 transitions. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:26,329 INFO L93 Difference]: Finished difference Result 190 states and 235 transitions. [2025-02-08 06:35:26,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:35:26,329 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-02-08 06:35:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:26,330 INFO L225 Difference]: With dead ends: 190 [2025-02-08 06:35:26,330 INFO L226 Difference]: Without dead ends: 190 [2025-02-08 06:35:26,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=1256, Unknown=2, NotChecked=0, Total=1406 [2025-02-08 06:35:26,330 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 24 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:26,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 825 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:26,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-08 06:35:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2025-02-08 06:35:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 164 states have (on average 1.3475609756097562) internal successors, (221), 180 states have internal predecessors, (221), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 233 transitions. [2025-02-08 06:35:26,335 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 233 transitions. Word has length 44 [2025-02-08 06:35:26,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:26,335 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 233 transitions. [2025-02-08 06:35:26,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 23 states have internal predecessors, (67), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 233 transitions. [2025-02-08 06:35:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:35:26,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:26,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:26,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:35:26,539 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,SelfDestructingSolverStorable31 [2025-02-08 06:35:26,540 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:26,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:26,540 INFO L85 PathProgramCache]: Analyzing trace with hash 64820192, now seen corresponding path program 1 times [2025-02-08 06:35:26,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:26,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38285732] [2025-02-08 06:35:26,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:26,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:35:26,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:35:26,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:26,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:26,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:26,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38285732] [2025-02-08 06:35:26,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38285732] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:26,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559651434] [2025-02-08 06:35:26,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:26,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:26,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:26,853 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-02-08 06:35:26,862 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-02-08 06:35:26,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:35:26,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:35:26,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:26,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:26,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-08 06:35:26,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:27,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:35:27,106 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:27,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:27,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:27,141 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-02-08 06:35:27,213 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:35:27,213 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-02-08 06:35:27,218 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-02-08 06:35:27,297 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 25 treesize of output 13 [2025-02-08 06:35:27,301 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 7 treesize of output 3 [2025-02-08 06:35:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:27,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:27,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:27,514 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 18 treesize of output 19 [2025-02-08 06:35:27,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:27,523 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 34 treesize of output 37 [2025-02-08 06:35:27,526 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-02-08 06:35:27,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:27,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-02-08 06:35:27,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:27,548 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 1 case distinctions, treesize of input 29 treesize of output 30 [2025-02-08 06:35:27,550 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:27,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-08 06:35:27,553 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:27,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-08 06:35:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559651434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:27,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 24 [2025-02-08 06:35:27,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530935525] [2025-02-08 06:35:27,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:27,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 06:35:27,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:27,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 06:35:27,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=942, Unknown=3, NotChecked=0, Total=1056 [2025-02-08 06:35:27,642 INFO L87 Difference]: Start difference. First operand 189 states and 233 transitions. Second operand has 25 states, 24 states have (on average 2.625) internal successors, (63), 21 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:27,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:27,857 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2025-02-08 06:35:27,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:35:27,857 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 21 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2025-02-08 06:35:27,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:27,858 INFO L225 Difference]: With dead ends: 190 [2025-02-08 06:35:27,858 INFO L226 Difference]: Without dead ends: 190 [2025-02-08 06:35:27,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=1044, Unknown=3, NotChecked=0, Total=1190 [2025-02-08 06:35:27,858 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 17 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:27,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 790 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:27,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-08 06:35:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2025-02-08 06:35:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 164 states have (on average 1.3414634146341464) internal successors, (220), 180 states have internal predecessors, (220), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 232 transitions. [2025-02-08 06:35:27,861 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 232 transitions. Word has length 44 [2025-02-08 06:35:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:27,862 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 232 transitions. [2025-02-08 06:35:27,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.625) internal successors, (63), 21 states have internal predecessors, (63), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 232 transitions. [2025-02-08 06:35:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:35:27,862 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:27,862 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:27,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 06:35:28,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:28,067 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:28,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:28,067 INFO L85 PathProgramCache]: Analyzing trace with hash -492388920, now seen corresponding path program 1 times [2025-02-08 06:35:28,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:28,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589720208] [2025-02-08 06:35:28,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:28,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:28,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:35:28,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:35:28,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:28,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:35:28,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589720208] [2025-02-08 06:35:28,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589720208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:28,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544291043] [2025-02-08 06:35:28,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:28,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:28,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:28,265 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-02-08 06:35:28,266 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-02-08 06:35:28,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:35:28,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:35:28,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:28,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:28,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 06:35:28,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:28,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:28,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:28,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:28,460 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:35:28,461 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-02-08 06:35:28,467 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 25 treesize of output 13 [2025-02-08 06:35:28,477 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-02-08 06:35:28,510 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:35:28,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:35:28,511 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2025-02-08 06:35:28,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:28,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544291043] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:28,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:28,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2025-02-08 06:35:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369757924] [2025-02-08 06:35:28,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:28,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:35:28,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:28,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:35:28,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-02-08 06:35:28,553 INFO L87 Difference]: Start difference. First operand 189 states and 232 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 06:35:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:28,756 INFO L93 Difference]: Finished difference Result 188 states and 231 transitions. [2025-02-08 06:35:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:35:28,756 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2025-02-08 06:35:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:28,757 INFO L225 Difference]: With dead ends: 188 [2025-02-08 06:35:28,757 INFO L226 Difference]: Without dead ends: 188 [2025-02-08 06:35:28,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=517, Unknown=1, NotChecked=46, Total=650 [2025-02-08 06:35:28,757 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 10 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:28,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 530 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 279 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2025-02-08 06:35:28,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-08 06:35:28,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2025-02-08 06:35:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 164 states have (on average 1.3353658536585367) internal successors, (219), 179 states have internal predecessors, (219), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 231 transitions. [2025-02-08 06:35:28,761 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 231 transitions. Word has length 46 [2025-02-08 06:35:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:28,762 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 231 transitions. [2025-02-08 06:35:28,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 17 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-08 06:35:28,762 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 231 transitions. [2025-02-08 06:35:28,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:35:28,762 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:28,762 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:28,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 06:35:28,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:28,963 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:28,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:28,964 INFO L85 PathProgramCache]: Analyzing trace with hash -492388919, now seen corresponding path program 1 times [2025-02-08 06:35:28,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:28,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762445865] [2025-02-08 06:35:28,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:28,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:28,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:35:28,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:35:28,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:28,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:29,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:29,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762445865] [2025-02-08 06:35:29,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762445865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:29,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771434868] [2025-02-08 06:35:29,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:29,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:29,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:29,334 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-02-08 06:35:29,337 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-02-08 06:35:29,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 06:35:29,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:35:29,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:29,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:29,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-08 06:35:29,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:29,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:35:29,494 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:29,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:29,513 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-02-08 06:35:29,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:29,561 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:35:29,561 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-02-08 06:35:29,564 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-02-08 06:35:29,572 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 25 treesize of output 13 [2025-02-08 06:35:29,575 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 7 treesize of output 3 [2025-02-08 06:35:29,648 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:29,648 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-02-08 06:35:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:29,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:29,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771434868] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:29,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:29,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 25 [2025-02-08 06:35:29,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406816650] [2025-02-08 06:35:29,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:29,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 06:35:29,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:29,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 06:35:29,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2025-02-08 06:35:29,721 INFO L87 Difference]: Start difference. First operand 188 states and 231 transitions. Second operand has 26 states, 25 states have (on average 2.44) internal successors, (61), 21 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:30,101 INFO L93 Difference]: Finished difference Result 186 states and 229 transitions. [2025-02-08 06:35:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:35:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 21 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2025-02-08 06:35:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:30,102 INFO L225 Difference]: With dead ends: 186 [2025-02-08 06:35:30,102 INFO L226 Difference]: Without dead ends: 186 [2025-02-08 06:35:30,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1112, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 06:35:30,102 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 26 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:30,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 691 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 479 Invalid, 1 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-08 06:35:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2025-02-08 06:35:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.3170731707317074) internal successors, (216), 176 states have internal predecessors, (216), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 228 transitions. [2025-02-08 06:35:30,106 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 228 transitions. Word has length 46 [2025-02-08 06:35:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:30,106 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 228 transitions. [2025-02-08 06:35:30,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.44) internal successors, (61), 21 states have internal predecessors, (61), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 228 transitions. [2025-02-08 06:35:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:35:30,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:30,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:30,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-08 06:35:30,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:30,307 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:30,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2009420999, now seen corresponding path program 1 times [2025-02-08 06:35:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506096742] [2025-02-08 06:35:30,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:30,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:35:30,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:35:30,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:30,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:30,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:30,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506096742] [2025-02-08 06:35:30,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506096742] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:30,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806641215] [2025-02-08 06:35:30,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:30,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:30,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:30,545 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-02-08 06:35:30,547 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-02-08 06:35:30,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:35:30,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:35:30,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:30,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:30,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 06:35:30,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:30,739 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-02-08 06:35:30,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:30,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:35:30,761 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:30,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:30,841 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:30,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806641215] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:30,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:30,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 22 [2025-02-08 06:35:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594654591] [2025-02-08 06:35:30,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:30,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 06:35:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:30,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 06:35:30,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=618, Unknown=1, NotChecked=50, Total=756 [2025-02-08 06:35:30,979 INFO L87 Difference]: Start difference. First operand 185 states and 228 transitions. Second operand has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:31,242 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2025-02-08 06:35:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:35:31,243 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2025-02-08 06:35:31,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:31,243 INFO L225 Difference]: With dead ends: 187 [2025-02-08 06:35:31,243 INFO L226 Difference]: Without dead ends: 187 [2025-02-08 06:35:31,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=928, Unknown=1, NotChecked=62, Total=1122 [2025-02-08 06:35:31,244 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 69 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:31,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 599 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 486 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2025-02-08 06:35:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-08 06:35:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 158. [2025-02-08 06:35:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 138 states have (on average 1.2391304347826086) internal successors, (171), 149 states have internal predecessors, (171), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 183 transitions. [2025-02-08 06:35:31,247 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 183 transitions. Word has length 45 [2025-02-08 06:35:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:31,247 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 183 transitions. [2025-02-08 06:35:31,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 20 states have internal predecessors, (73), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 183 transitions. [2025-02-08 06:35:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:35:31,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:31,248 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:31,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:31,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-08 06:35:31,448 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:31,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash 243132661, now seen corresponding path program 1 times [2025-02-08 06:35:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364913178] [2025-02-08 06:35:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:31,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:35:31,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:35:31,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:31,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:31,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:31,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:31,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364913178] [2025-02-08 06:35:31,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364913178] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:31,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126118620] [2025-02-08 06:35:31,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:31,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:31,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:31,542 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-02-08 06:35:31,543 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-02-08 06:35:31,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:35:31,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:35:31,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:31,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:31,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-08 06:35:31,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:31,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:31,797 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 15 [2025-02-08 06:35:31,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:31,802 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 15 [2025-02-08 06:35:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:31,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:31,957 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-02-08 06:35:31,957 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 24 treesize of output 23 [2025-02-08 06:35:31,963 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-02-08 06:35:31,963 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 20 treesize of output 12 [2025-02-08 06:35:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:32,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126118620] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:32,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:32,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 14] total 24 [2025-02-08 06:35:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024254841] [2025-02-08 06:35:32,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:35:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:32,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:35:32,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:35:32,037 INFO L87 Difference]: Start difference. First operand 158 states and 183 transitions. Second operand has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:35:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:32,405 INFO L93 Difference]: Finished difference Result 199 states and 238 transitions. [2025-02-08 06:35:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:35:32,406 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2025-02-08 06:35:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:32,407 INFO L225 Difference]: With dead ends: 199 [2025-02-08 06:35:32,407 INFO L226 Difference]: Without dead ends: 199 [2025-02-08 06:35:32,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=892, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:35:32,407 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:32,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 851 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:32,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-08 06:35:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2025-02-08 06:35:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 173 states have (on average 1.2716763005780347) internal successors, (220), 184 states have internal predecessors, (220), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:32,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 232 transitions. [2025-02-08 06:35:32,411 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 232 transitions. Word has length 45 [2025-02-08 06:35:32,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:32,412 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 232 transitions. [2025-02-08 06:35:32,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-08 06:35:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 232 transitions. [2025-02-08 06:35:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:35:32,413 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:32,413 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:32,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-08 06:35:32,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:32,614 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:32,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:32,615 INFO L85 PathProgramCache]: Analyzing trace with hash 243132310, now seen corresponding path program 1 times [2025-02-08 06:35:32,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:32,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545195927] [2025-02-08 06:35:32,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:32,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:32,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:35:32,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:35:32,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:32,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:33,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:33,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545195927] [2025-02-08 06:35:33,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545195927] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:33,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850445958] [2025-02-08 06:35:33,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:33,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:33,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:33,276 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:33,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-08 06:35:33,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:35:33,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:35:33,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:33,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:33,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-08 06:35:33,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:33,669 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-02-08 06:35:33,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:33,787 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 41 treesize of output 31 [2025-02-08 06:35:34,265 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_25| Int) (|v_ULTIMATE.start_destroy_internal_~l#1.base_21| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_internal_~l#1.base_21| 0) |v_ULTIMATE.start_destroy_~l#1.base_25| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_25|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_destroy_~l#1.base_25| 1) |v_ULTIMATE.start_destroy_internal_~l#1.base_21|) 0))) is different from true [2025-02-08 06:35:34,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2025-02-08 06:35:34,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:34,509 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 48 treesize of output 44 [2025-02-08 06:35:35,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850445958] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:35,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:35,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20] total 35 [2025-02-08 06:35:35,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077261129] [2025-02-08 06:35:35,127 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:35,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-08 06:35:35,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:35,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-08 06:35:35,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=2042, Unknown=1, NotChecked=90, Total=2256 [2025-02-08 06:35:35,128 INFO L87 Difference]: Start difference. First operand 193 states and 232 transitions. Second operand has 37 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 31 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:36,466 INFO L93 Difference]: Finished difference Result 202 states and 241 transitions. [2025-02-08 06:35:36,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 06:35:36,467 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 31 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2025-02-08 06:35:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:36,468 INFO L225 Difference]: With dead ends: 202 [2025-02-08 06:35:36,468 INFO L226 Difference]: Without dead ends: 179 [2025-02-08 06:35:36,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=218, Invalid=3325, Unknown=1, NotChecked=116, Total=3660 [2025-02-08 06:35:36,469 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:36,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 825 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1485 Invalid, 0 Unknown, 105 Unchecked, 0.8s Time] [2025-02-08 06:35:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-08 06:35:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2025-02-08 06:35:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 169 states have internal predecessors, (204), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:35:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 216 transitions. [2025-02-08 06:35:36,477 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 216 transitions. Word has length 45 [2025-02-08 06:35:36,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:36,477 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 216 transitions. [2025-02-08 06:35:36,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.3823529411764706) internal successors, (81), 31 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:36,477 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 216 transitions. [2025-02-08 06:35:36,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 06:35:36,477 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:36,477 INFO L218 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:36,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-08 06:35:36,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-08 06:35:36,678 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2025-02-08 06:35:36,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:36,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1676961078, now seen corresponding path program 2 times [2025-02-08 06:35:36,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:36,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749626772] [2025-02-08 06:35:36,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:35:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:36,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-08 06:35:36,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 06:35:36,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:35:36,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:37,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749626772] [2025-02-08 06:35:37,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749626772] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:37,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279737751] [2025-02-08 06:35:37,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:35:37,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:37,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:37,369 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:37,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-08 06:35:37,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-02-08 06:35:37,504 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 06:35:37,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:35:37,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:37,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-08 06:35:37,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:37,562 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-02-08 06:35:37,565 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-02-08 06:35:37,574 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 19 treesize of output 18 [2025-02-08 06:35:37,580 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 19 treesize of output 18 [2025-02-08 06:35:37,650 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:37,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:37,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2025-02-08 06:35:37,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2025-02-08 06:35:37,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:37,800 INFO L349 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2025-02-08 06:35:37,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 115 treesize of output 87 [2025-02-08 06:35:37,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:37,816 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2025-02-08 06:35:37,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 43 [2025-02-08 06:35:37,996 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:37,996 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:52,166 INFO L349 Elim1Store]: treesize reduction 474, result has 43.8 percent of original size [2025-02-08 06:35:52,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 2076 treesize of output 1701 [2025-02-08 06:35:52,578 INFO L349 Elim1Store]: treesize reduction 192, result has 40.9 percent of original size [2025-02-08 06:35:52,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 23 case distinctions, treesize of input 2143 treesize of output 1825 [2025-02-08 06:35:52,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:52,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 1603 treesize of output 1683 [2025-02-08 06:35:53,540 INFO L349 Elim1Store]: treesize reduction 750, result has 41.4 percent of original size [2025-02-08 06:35:53,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 2152 treesize of output 1919 [2025-02-08 06:35:53,959 INFO L349 Elim1Store]: treesize reduction 312, result has 41.5 percent of original size [2025-02-08 06:35:53,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 1472 treesize of output 1594 [2025-02-08 06:35:54,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:54,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1458 treesize of output 1594