./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/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 fca5cc24d72663534ebec1f9dc14e35435ad722dffdf26757e6dcfe47c5f2a9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:34:18,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:34:18,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-01-09 22:34:18,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:34:18,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:34:18,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:34:18,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:34:18,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:34:18,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:34:18,155 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:34:18,155 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:34:18,155 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:34:18,156 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:34:18,156 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:34:18,156 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:34:18,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:34:18,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:34:18,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:34:18,156 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:34:18,156 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:34:18,156 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:34:18,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:34:18,157 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:34:18,157 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:34:18,157 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:34:18,157 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:34:18,157 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:34:18,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:18,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:18,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:18,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:18,157 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:18,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:34:18,158 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:34:18,159 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 -> fca5cc24d72663534ebec1f9dc14e35435ad722dffdf26757e6dcfe47c5f2a9e [2025-01-09 22:34:18,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:34:18,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:34:18,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:34:18,386 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:34:18,387 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:34:18,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll.i [2025-01-09 22:34:19,597 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/572bc5585/c0e2ba30ac604d2c9e74d2596170e0f8/FLAG45bad354b [2025-01-09 22:34:19,917 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:34:19,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll.i [2025-01-09 22:34:19,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/572bc5585/c0e2ba30ac604d2c9e74d2596170e0f8/FLAG45bad354b [2025-01-09 22:34:19,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/572bc5585/c0e2ba30ac604d2c9e74d2596170e0f8 [2025-01-09 22:34:19,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:34:19,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:34:19,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:19,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:34:19,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:34:19,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:19" (1/1) ... [2025-01-09 22:34:19,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fea83a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:19, skipping insertion in model container [2025-01-09 22:34:19,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:34:19" (1/1) ... [2025-01-09 22:34:19,972 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:34:20,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:20,116 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:34:20,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:34:20,163 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:34:20,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20 WrapperNode [2025-01-09 22:34:20,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:34:20,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:20,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:34:20,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:34:20,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,175 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,185 INFO L138 Inliner]: procedures = 118, calls = 14, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 47 [2025-01-09 22:34:20,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:34:20,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:34:20,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:34:20,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:34:20,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,199 INFO L175 MemorySlicer]: Split 5 memory accesses to 1 slices as follows [5]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-01-09 22:34:20,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,202 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,205 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,205 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,206 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:34:20,207 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:34:20,207 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:34:20,207 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:34:20,208 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (1/1) ... [2025-01-09 22:34:20,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:34:20,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:20,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:34:20,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:34:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-01-09 22:34:20,249 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-01-09 22:34:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:34:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:34:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:34:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:34:20,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:34:20,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:34:20,308 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:34:20,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:34:20,419 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2025-01-09 22:34:20,421 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:34:20,429 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:34:20,429 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 22:34:20,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:20 BoogieIcfgContainer [2025-01-09 22:34:20,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:34:20,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:34:20,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:34:20,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:34:20,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:34:19" (1/3) ... [2025-01-09 22:34:20,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f20ba27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:20, skipping insertion in model container [2025-01-09 22:34:20,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:34:20" (2/3) ... [2025-01-09 22:34:20,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f20ba27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:34:20, skipping insertion in model container [2025-01-09 22:34:20,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:34:20" (3/3) ... [2025-01-09 22:34:20,438 INFO L128 eAbstractionObserver]: Analyzing ICFG sll.i [2025-01-09 22:34:20,447 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:34:20,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll.i that has 2 procedures, 46 locations, 1 initial locations, 3 loop locations, and 14 error locations. [2025-01-09 22:34:20,469 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:34:20,476 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;@7f0abc5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:34:20,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-01-09 22:34:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 42 states have internal predecessors, (46), 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-01-09 22:34:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:34:20,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:20,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:34:20,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:20,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash 34475877, now seen corresponding path program 1 times [2025-01-09 22:34:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:20,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781689319] [2025-01-09 22:34:20,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:20,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:34:20,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:34:20,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:20,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:20,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:20,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781689319] [2025-01-09 22:34:20,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781689319] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:20,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:20,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020611376] [2025-01-09 22:34:20,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:20,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:20,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:20,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:20,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:20,634 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 42 states have internal predecessors, (46), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:34:20,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:20,678 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2025-01-09 22:34:20,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:20,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-01-09 22:34:20,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:20,684 INFO L225 Difference]: With dead ends: 45 [2025-01-09 22:34:20,684 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 22:34:20,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:20,689 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:20,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 75 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 22:34:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 22:34:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 39 states have internal predecessors, (42), 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-01-09 22:34:20,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-01-09 22:34:20,716 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 5 [2025-01-09 22:34:20,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:20,716 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-01-09 22:34:20,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:34:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-01-09 22:34:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:34:20,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:20,717 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:34:20,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:34:20,717 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:20,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 34475878, now seen corresponding path program 1 times [2025-01-09 22:34:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:20,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033697729] [2025-01-09 22:34:20,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:20,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:34:20,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:34:20,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:20,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033697729] [2025-01-09 22:34:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033697729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:20,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:20,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:34:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865112024] [2025-01-09 22:34:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:20,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:34:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:20,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:34:20,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:20,799 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:34:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:20,815 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-01-09 22:34:20,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:34:20,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 5 [2025-01-09 22:34:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:20,816 INFO L225 Difference]: With dead ends: 42 [2025-01-09 22:34:20,816 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 22:34:20,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:34:20,817 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:20,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 22:34:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 22:34:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 38 states have internal predecessors, (41), 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-01-09 22:34:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-01-09 22:34:20,820 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 5 [2025-01-09 22:34:20,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:20,820 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-01-09 22:34:20,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-01-09 22:34:20,820 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-01-09 22:34:20,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:34:20,821 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:20,821 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:20,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:34:20,821 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:20,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2008419311, now seen corresponding path program 1 times [2025-01-09 22:34:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:20,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021385588] [2025-01-09 22:34:20,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:20,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:20,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:34:20,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:34:20,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:20,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:20,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:20,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:20,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021385588] [2025-01-09 22:34:20,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021385588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:20,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:20,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:34:20,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90712577] [2025-01-09 22:34:20,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:20,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:34:20,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:20,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:34:20,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:20,952 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:21,047 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-01-09 22:34:21,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 22:34:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:21,049 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:34:21,049 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:34:21,049 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-01-09 22:34:21,050 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:21,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 153 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:21,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:34:21,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-01-09 22:34:21,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 44 states have internal predecessors, (50), 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-01-09 22:34:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-01-09 22:34:21,054 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 15 [2025-01-09 22:34:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:21,054 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-01-09 22:34:21,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-01-09 22:34:21,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 22:34:21,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:21,055 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:21,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:34:21,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:21,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2008419310, now seen corresponding path program 1 times [2025-01-09 22:34:21,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:21,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749347353] [2025-01-09 22:34:21,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:21,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 22:34:21,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 22:34:21,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:21,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:21,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:21,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749347353] [2025-01-09 22:34:21,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749347353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:21,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 22:34:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556579873] [2025-01-09 22:34:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:21,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:34:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:21,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:34:21,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:21,269 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:21,341 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-01-09 22:34:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:21,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-01-09 22:34:21,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:21,342 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:34:21,342 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:34:21,342 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-01-09 22:34:21,343 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:21,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 186 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:21,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:34:21,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-01-09 22:34:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 44 states have internal predecessors, (49), 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-01-09 22:34:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-01-09 22:34:21,346 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 15 [2025-01-09 22:34:21,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:21,346 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-01-09 22:34:21,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:21,346 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-01-09 22:34:21,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:34:21,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:21,346 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:21,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:34:21,346 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:21,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash 393749133, now seen corresponding path program 1 times [2025-01-09 22:34:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106714702] [2025-01-09 22:34:21,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:21,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:21,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:21,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:21,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:21,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:21,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106714702] [2025-01-09 22:34:21,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106714702] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:21,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351590540] [2025-01-09 22:34:21,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:21,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:21,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:21,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:21,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:34:21,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:21,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:21,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:21,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:21,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:34:21,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:21,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:21,608 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-01-09 22:34:21,642 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:34:21,643 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-01-09 22:34:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:34:21,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351590540] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:21,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2025-01-09 22:34:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921275238] [2025-01-09 22:34:21,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:34:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:21,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:34:21,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=86, Unknown=1, NotChecked=18, Total=132 [2025-01-09 22:34:21,719 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:34:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:21,847 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-01-09 22:34:21,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:21,850 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2025-01-09 22:34:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:21,850 INFO L225 Difference]: With dead ends: 49 [2025-01-09 22:34:21,851 INFO L226 Difference]: Without dead ends: 49 [2025-01-09 22:34:21,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 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-01-09 22:34:21,852 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:21,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 165 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2025-01-09 22:34:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-01-09 22:34:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-01-09 22:34:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 44 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-01-09 22:34:21,861 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 18 [2025-01-09 22:34:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:21,861 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-01-09 22:34:21,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:34:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-01-09 22:34:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:34:21,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:21,862 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:21,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 22:34:22,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:22,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:22,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:22,064 INFO L85 PathProgramCache]: Analyzing trace with hash 393749134, now seen corresponding path program 1 times [2025-01-09 22:34:22,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:22,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361047045] [2025-01-09 22:34:22,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:22,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:22,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:22,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:22,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:22,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:22,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:22,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:22,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361047045] [2025-01-09 22:34:22,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361047045] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:22,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119578005] [2025-01-09 22:34:22,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:22,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:22,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:22,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:22,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:34:22,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:22,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:22,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:22,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:22,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-01-09 22:34:22,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:22,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:34:22,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:22,484 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-01-09 22:34:22,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:22,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:34:22,521 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:34:22,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:22,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119578005] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:22,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:22,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-01-09 22:34:22,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012023666] [2025-01-09 22:34:22,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:22,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:34:22,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:22,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:34:22,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=232, Unknown=1, NotChecked=30, Total=306 [2025-01-09 22:34:22,652 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 11 states have internal predecessors, (26), 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-01-09 22:34:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:22,856 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-01-09 22:34:22,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:22,857 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 11 states have internal predecessors, (26), 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 18 [2025-01-09 22:34:22,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:22,857 INFO L225 Difference]: With dead ends: 51 [2025-01-09 22:34:22,857 INFO L226 Difference]: Without dead ends: 51 [2025-01-09 22:34:22,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2025-01-09 22:34:22,858 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:22,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 262 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2025-01-09 22:34:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-01-09 22:34:22,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-01-09 22:34:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 46 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:22,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2025-01-09 22:34:22,861 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 18 [2025-01-09 22:34:22,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:22,862 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2025-01-09 22:34:22,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 11 states have internal predecessors, (26), 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-01-09 22:34:22,862 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2025-01-09 22:34:22,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:34:22,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:22,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:22,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:34:23,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:23,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:23,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:23,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1650455821, now seen corresponding path program 1 times [2025-01-09 22:34:23,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:23,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114595804] [2025-01-09 22:34:23,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:23,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:23,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:34:23,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:34:23,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:23,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114595804] [2025-01-09 22:34:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114595804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:23,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:23,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:23,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322202713] [2025-01-09 22:34:23,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:23,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 22:34:23,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:23,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 22:34:23,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:34:23,150 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:23,186 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-01-09 22:34:23,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:34:23,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2025-01-09 22:34:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:23,186 INFO L225 Difference]: With dead ends: 53 [2025-01-09 22:34:23,186 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 22:34:23,187 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-01-09 22:34:23,187 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:23,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 237 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 22:34:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2025-01-09 22:34:23,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:23,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-01-09 22:34:23,193 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 17 [2025-01-09 22:34:23,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:23,194 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-01-09 22:34:23,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-01-09 22:34:23,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 22:34:23,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:23,194 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:23,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:34:23,194 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:23,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:23,195 INFO L85 PathProgramCache]: Analyzing trace with hash 369719357, now seen corresponding path program 1 times [2025-01-09 22:34:23,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:23,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627182156] [2025-01-09 22:34:23,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:23,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:23,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:23,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:23,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:23,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:23,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:23,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627182156] [2025-01-09 22:34:23,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627182156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:23,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760689136] [2025-01-09 22:34:23,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:23,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:23,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:23,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:23,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:34:23,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 22:34:23,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 22:34:23,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:23,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:23,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 22:34:23,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:23,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:34:23,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:23,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:23,648 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:23,649 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:34:23,653 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:23,653 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:34:23,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:23,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:24,174 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 10 treesize of output 8 [2025-01-09 22:34:24,179 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 14 treesize of output 12 [2025-01-09 22:34:24,188 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 10 treesize of output 8 [2025-01-09 22:34:24,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760689136] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:24,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2025-01-09 22:34:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265969477] [2025-01-09 22:34:24,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:24,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:34:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:24,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:34:24,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:34:24,220 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 21 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:34:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:24,520 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2025-01-09 22:34:24,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:34:24,520 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 21 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2025-01-09 22:34:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:24,521 INFO L225 Difference]: With dead ends: 54 [2025-01-09 22:34:24,522 INFO L226 Difference]: Without dead ends: 54 [2025-01-09 22:34:24,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:34:24,523 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 3 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:24,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 522 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:34:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-01-09 22:34:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-01-09 22:34:24,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.358974358974359) internal successors, (53), 49 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:24,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2025-01-09 22:34:24,528 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 18 [2025-01-09 22:34:24,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:24,530 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2025-01-09 22:34:24,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 21 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-09 22:34:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2025-01-09 22:34:24,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:34:24,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:24,530 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-01-09 22:34:24,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:24,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:24,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:24,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1181797345, now seen corresponding path program 1 times [2025-01-09 22:34:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538733561] [2025-01-09 22:34:24,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:24,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:24,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:34:24,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:34:24,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:24,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:24,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:24,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538733561] [2025-01-09 22:34:24,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538733561] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:24,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:24,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683414176] [2025-01-09 22:34:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:24,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:24,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:24,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:24,797 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:24,882 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2025-01-09 22:34:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:24,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-09 22:34:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:24,882 INFO L225 Difference]: With dead ends: 56 [2025-01-09 22:34:24,882 INFO L226 Difference]: Without dead ends: 56 [2025-01-09 22:34:24,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:24,883 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:24,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:24,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-01-09 22:34:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-01-09 22:34:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 51 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2025-01-09 22:34:24,886 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 20 [2025-01-09 22:34:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:24,886 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2025-01-09 22:34:24,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2025-01-09 22:34:24,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:34:24,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:24,886 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-01-09 22:34:24,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:34:24,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:24,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:24,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1181797344, now seen corresponding path program 1 times [2025-01-09 22:34:24,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:24,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401342303] [2025-01-09 22:34:24,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:24,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:24,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:34:24,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:34:24,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:24,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:25,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401342303] [2025-01-09 22:34:25,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401342303] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:25,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:25,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:25,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512240673] [2025-01-09 22:34:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:25,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:25,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:25,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:25,015 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:25,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:25,096 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2025-01-09 22:34:25,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:25,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-09 22:34:25,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:25,097 INFO L225 Difference]: With dead ends: 58 [2025-01-09 22:34:25,097 INFO L226 Difference]: Without dead ends: 58 [2025-01-09 22:34:25,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:25,098 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:25,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 175 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-01-09 22:34:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-01-09 22:34:25,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:25,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-01-09 22:34:25,101 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 20 [2025-01-09 22:34:25,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:25,101 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-01-09 22:34:25,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-01-09 22:34:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 22:34:25,101 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:25,102 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] [2025-01-09 22:34:25,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:34:25,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:25,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2018999940, now seen corresponding path program 1 times [2025-01-09 22:34:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985405187] [2025-01-09 22:34:25,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 22:34:25,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 22:34:25,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:25,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985405187] [2025-01-09 22:34:25,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985405187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:25,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:25,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 22:34:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227946837] [2025-01-09 22:34:25,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:25,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:25,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:25,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:25,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:25,183 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:25,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:25,231 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-01-09 22:34:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2025-01-09 22:34:25,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:25,232 INFO L225 Difference]: With dead ends: 65 [2025-01-09 22:34:25,232 INFO L226 Difference]: Without dead ends: 65 [2025-01-09 22:34:25,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:25,233 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:25,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 235 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:25,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-01-09 22:34:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2025-01-09 22:34:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 45 states have (on average 1.288888888888889) internal successors, (58), 54 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-01-09 22:34:25,236 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 21 [2025-01-09 22:34:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:25,236 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-01-09 22:34:25,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-01-09 22:34:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:34:25,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:25,237 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] [2025-01-09 22:34:25,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:34:25,237 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:25,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1077754694, now seen corresponding path program 1 times [2025-01-09 22:34:25,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:25,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482879930] [2025-01-09 22:34:25,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:34:25,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:34:25,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:25,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482879930] [2025-01-09 22:34:25,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482879930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:34:25,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:34:25,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 22:34:25,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795118700] [2025-01-09 22:34:25,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:34:25,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 22:34:25,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:25,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 22:34:25,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:25,315 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:25,381 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-01-09 22:34:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:34:25,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-09 22:34:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:25,382 INFO L225 Difference]: With dead ends: 64 [2025-01-09 22:34:25,382 INFO L226 Difference]: Without dead ends: 64 [2025-01-09 22:34:25,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:34:25,383 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:25,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 203 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-01-09 22:34:25,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-01-09 22:34:25,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 49 states have (on average 1.3265306122448979) internal successors, (65), 58 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2025-01-09 22:34:25,386 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 23 [2025-01-09 22:34:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:25,386 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2025-01-09 22:34:25,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2025-01-09 22:34:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:34:25,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:25,386 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] [2025-01-09 22:34:25,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:34:25,387 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:25,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1197029081, now seen corresponding path program 1 times [2025-01-09 22:34:25,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:25,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972200208] [2025-01-09 22:34:25,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:34:25,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:34:25,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:34:25,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972200208] [2025-01-09 22:34:25,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972200208] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:25,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146171690] [2025-01-09 22:34:25,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:25,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:25,455 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:25,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:34:25,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:34:25,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:34:25,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 22:34:25,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:34:25,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:25,560 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:34:25,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-01-09 22:34:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:34:25,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146171690] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:25,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:25,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2025-01-09 22:34:25,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311291581] [2025-01-09 22:34:25,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:25,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:34:25,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:25,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:34:25,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:25,576 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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-01-09 22:34:25,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:25,626 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-01-09 22:34:25,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:34:25,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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 27 [2025-01-09 22:34:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:25,627 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:34:25,627 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:34:25,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:34:25,628 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 2 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:25,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 162 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:34:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-01-09 22:34:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 65 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2025-01-09 22:34:25,630 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 27 [2025-01-09 22:34:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:25,631 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2025-01-09 22:34:25,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 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-01-09 22:34:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2025-01-09 22:34:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:34:25,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:25,631 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] [2025-01-09 22:34:25,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:34:25,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 22:34:25,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:25,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1197029082, now seen corresponding path program 1 times [2025-01-09 22:34:25,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:25,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338039689] [2025-01-09 22:34:25,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:25,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:34:25,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:34:25,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:25,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:25,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:25,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338039689] [2025-01-09 22:34:25,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338039689] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:25,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973634957] [2025-01-09 22:34:25,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:25,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:25,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:25,982 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:25,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:34:26,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:34:26,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:34:26,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:26,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 22:34:26,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:26,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:26,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:26,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:26,212 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-01-09 22:34:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:26,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973634957] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:26,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:26,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2025-01-09 22:34:26,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418011665] [2025-01-09 22:34:26,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:26,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 22:34:26,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:26,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 22:34:26,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:34:26,318 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:26,391 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2025-01-09 22:34:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:34:26,391 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 1 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 27 [2025-01-09 22:34:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:26,392 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:34:26,393 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:34:26,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 22:34:26,394 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 4 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:26,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 361 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:26,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:34:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-01-09 22:34:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 65 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2025-01-09 22:34:26,400 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 27 [2025-01-09 22:34:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:26,400 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2025-01-09 22:34:26,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 15 states have internal predecessors, (40), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:26,400 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2025-01-09 22:34:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:34:26,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:26,401 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] [2025-01-09 22:34:26,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:34:26,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 22:34:26,602 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:26,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1785505988, now seen corresponding path program 1 times [2025-01-09 22:34:26,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:26,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310111734] [2025-01-09 22:34:26,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:26,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:26,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:34:26,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:34:26,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:26,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:26,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310111734] [2025-01-09 22:34:26,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310111734] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:26,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385210849] [2025-01-09 22:34:26,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:26,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:26,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:26,765 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:26,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:34:26,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:34:26,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:34:26,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:26,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:26,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 22:34:26,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:26,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:26,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:27,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:27,081 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-01-09 22:34:27,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:27,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 22:34:27,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:27,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:27,396 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 10 treesize of output 8 [2025-01-09 22:34:27,397 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 14 treesize of output 12 [2025-01-09 22:34:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:27,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385210849] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:27,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:27,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 22 [2025-01-09 22:34:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831751033] [2025-01-09 22:34:27,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:27,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 22:34:27,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:27,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 22:34:27,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2025-01-09 22:34:27,401 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:34:27,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:27,976 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2025-01-09 22:34:27,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:34:27,977 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-01-09 22:34:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:27,977 INFO L225 Difference]: With dead ends: 83 [2025-01-09 22:34:27,977 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 22:34:27,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:34:27,978 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:27,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 287 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 22:34:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-01-09 22:34:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 76 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2025-01-09 22:34:27,988 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 26 [2025-01-09 22:34:27,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:27,988 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-01-09 22:34:27,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:34:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2025-01-09 22:34:27,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:34:27,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:27,989 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] [2025-01-09 22:34:27,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:28,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 22:34:28,190 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:28,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash -483877249, now seen corresponding path program 1 times [2025-01-09 22:34:28,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:28,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172659591] [2025-01-09 22:34:28,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:28,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:28,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:34:28,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:34:28,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:28,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:28,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:28,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172659591] [2025-01-09 22:34:28,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172659591] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:28,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963110348] [2025-01-09 22:34:28,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:28,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:28,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:28,369 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:28,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:34:28,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:34:28,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:34:28,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:28,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:28,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 22:34:28,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:28,473 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 13 treesize of output 9 [2025-01-09 22:34:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:28,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:28,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_27| Int)) (or (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_27| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_27|) 0)))) is different from false [2025-01-09 22:34:28,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963110348] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:28,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:28,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2025-01-09 22:34:28,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649779748] [2025-01-09 22:34:28,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:28,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:34:28,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:28,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:34:28,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:34:28,546 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:28,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:28,703 INFO L93 Difference]: Finished difference Result 86 states and 100 transitions. [2025-01-09 22:34:28,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:34:28,705 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2025-01-09 22:34:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:28,705 INFO L225 Difference]: With dead ends: 86 [2025-01-09 22:34:28,705 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 22:34:28,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:34:28,706 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:28,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 214 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 22:34:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 22:34:28,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 65 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2025-01-09 22:34:28,711 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 27 [2025-01-09 22:34:28,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:28,711 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2025-01-09 22:34:28,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 22:34:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2025-01-09 22:34:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:34:28,712 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:28,713 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:28,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 22:34:28,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:28,913 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:28,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:28,915 INFO L85 PathProgramCache]: Analyzing trace with hash -396064059, now seen corresponding path program 1 times [2025-01-09 22:34:28,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:28,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971717233] [2025-01-09 22:34:28,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:28,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:28,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:28,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:28,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:28,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:29,050 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:34:29,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971717233] [2025-01-09 22:34:29,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971717233] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:29,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409681321] [2025-01-09 22:34:29,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:29,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:29,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:29,056 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:29,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:34:29,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:29,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:29,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:29,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 22:34:29,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:29,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:29,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:29,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:34:29,157 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base 1))) is different from true [2025-01-09 22:34:29,170 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-01-09 22:34:29,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-01-09 22:34:29,179 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:34:29,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409681321] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:29,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 13 [2025-01-09 22:34:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310361425] [2025-01-09 22:34:29,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:29,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:34:29,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:29,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:34:29,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2025-01-09 22:34:29,275 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:34:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:29,415 INFO L93 Difference]: Finished difference Result 69 states and 83 transitions. [2025-01-09 22:34:29,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:34:29,415 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2025-01-09 22:34:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:29,416 INFO L225 Difference]: With dead ends: 69 [2025-01-09 22:34:29,416 INFO L226 Difference]: Without dead ends: 69 [2025-01-09 22:34:29,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 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-01-09 22:34:29,416 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:29,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 251 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2025-01-09 22:34:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-01-09 22:34:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-01-09 22:34:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.375) internal successors, (77), 64 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:29,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2025-01-09 22:34:29,418 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 30 [2025-01-09 22:34:29,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:29,418 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2025-01-09 22:34:29,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 22:34:29,418 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2025-01-09 22:34:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:34:29,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:29,421 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:29,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 22:34:29,626 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,SelfDestructingSolverStorable16 [2025-01-09 22:34:29,626 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:29,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash -396064058, now seen corresponding path program 1 times [2025-01-09 22:34:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:29,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046862330] [2025-01-09 22:34:29,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:29,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:29,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:29,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:29,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046862330] [2025-01-09 22:34:29,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046862330] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:29,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283303949] [2025-01-09 22:34:29,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:29,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:29,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:29,819 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:29,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:34:29,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:29,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:29,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:29,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:29,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 22:34:29,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:29,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:34:29,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:29,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:29,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:29,992 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-01-09 22:34:30,063 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-01-09 22:34:30,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:30,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:34:30,089 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:30,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:30,107 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:34:30,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:30,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283303949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:30,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:30,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-01-09 22:34:30,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882078393] [2025-01-09 22:34:30,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:30,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:34:30,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:30,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:34:30,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=372, Unknown=1, NotChecked=38, Total=462 [2025-01-09 22:34:30,200 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:34:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:30,457 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2025-01-09 22:34:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:34:30,458 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2025-01-09 22:34:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:30,458 INFO L225 Difference]: With dead ends: 67 [2025-01-09 22:34:30,458 INFO L226 Difference]: Without dead ends: 67 [2025-01-09 22:34:30,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=715, Unknown=1, NotChecked=54, Total=870 [2025-01-09 22:34:30,459 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 7 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:30,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 447 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 293 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2025-01-09 22:34:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-09 22:34:30,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-09 22:34:30,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 62 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-01-09 22:34:30,461 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 30 [2025-01-09 22:34:30,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:30,462 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-01-09 22:34:30,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 15 states have internal predecessors, (39), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-01-09 22:34:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-01-09 22:34:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:34:30,462 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:30,462 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:30,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-09 22:34:30,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 22:34:30,667 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:30,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:30,667 INFO L85 PathProgramCache]: Analyzing trace with hash -420093835, now seen corresponding path program 1 times [2025-01-09 22:34:30,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:30,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009765484] [2025-01-09 22:34:30,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:30,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:30,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:30,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:30,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 22:34:30,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009765484] [2025-01-09 22:34:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009765484] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513937245] [2025-01-09 22:34:30,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:30,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:30,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:30,790 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:30,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:34:30,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:30,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:30,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:30,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:30,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-01-09 22:34:30,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:30,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:30,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:30,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:34:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:31,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:31,068 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 28 [2025-01-09 22:34:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:31,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513937245] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:31,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:31,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 10] total 24 [2025-01-09 22:34:31,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072929280] [2025-01-09 22:34:31,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:31,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:34:31,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:31,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:34:31,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:34:31,150 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 21 states have internal predecessors, (57), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:34:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:31,319 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-01-09 22:34:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:34:31,320 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 21 states have internal predecessors, (57), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 30 [2025-01-09 22:34:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:31,320 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:34:31,320 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:34:31,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:34:31,321 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:31,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 368 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:31,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:34:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-01-09 22:34:31,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 65 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2025-01-09 22:34:31,323 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 30 [2025-01-09 22:34:31,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:31,323 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2025-01-09 22:34:31,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 21 states have internal predecessors, (57), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:34:31,323 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2025-01-09 22:34:31,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 22:34:31,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:31,323 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:31,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-09 22:34:31,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:31,528 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:31,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash -420093834, now seen corresponding path program 1 times [2025-01-09 22:34:31,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:31,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654043339] [2025-01-09 22:34:31,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:31,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:31,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:31,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:31,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:31,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:31,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654043339] [2025-01-09 22:34:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654043339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598925176] [2025-01-09 22:34:31,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:31,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:31,750 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:31,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:34:31,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 22:34:31,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 22:34:31,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:31,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:31,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 22:34:31,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:31,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:34:31,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:31,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:31,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 22:34:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:31,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:31,984 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 60 treesize of output 56 [2025-01-09 22:34:31,986 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 90 treesize of output 82 [2025-01-09 22:34:31,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:31,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:32,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598925176] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:32,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:32,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2025-01-09 22:34:32,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498543640] [2025-01-09 22:34:32,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:34:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:32,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:34:32,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:34:32,076 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:34:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:32,187 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2025-01-09 22:34:32,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:34:32,188 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-01-09 22:34:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:32,188 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:34:32,188 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:34:32,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:34:32,189 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 2 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:32,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:34:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-01-09 22:34:32,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 65 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:32,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2025-01-09 22:34:32,191 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 30 [2025-01-09 22:34:32,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:32,191 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2025-01-09 22:34:32,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 18 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:34:32,191 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2025-01-09 22:34:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:34:32,191 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:32,191 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-01-09 22:34:32,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:32,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:32,398 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:32,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash 16936535, now seen corresponding path program 1 times [2025-01-09 22:34:32,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205729166] [2025-01-09 22:34:32,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:32,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:32,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:34:32,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:34:32,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:32,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:34:32,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205729166] [2025-01-09 22:34:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205729166] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:32,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639959523] [2025-01-09 22:34:32,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:32,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:32,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:32,439 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:32,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:34:32,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:34:32,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:34:32,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:32,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:32,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 22:34:32,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:32,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:34:32,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:32,522 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:34:32,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-01-09 22:34:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:34:32,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639959523] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:32,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:32,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-01-09 22:34:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289751264] [2025-01-09 22:34:32,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:34:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:32,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:34:32,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:32,531 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:34:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:32,566 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2025-01-09 22:34:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-01-09 22:34:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:32,567 INFO L225 Difference]: With dead ends: 72 [2025-01-09 22:34:32,567 INFO L226 Difference]: Without dead ends: 72 [2025-01-09 22:34:32,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:34:32,567 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 9 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:32,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 92 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-01-09 22:34:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-01-09 22:34:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.305084745762712) internal successors, (77), 65 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2025-01-09 22:34:32,569 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 32 [2025-01-09 22:34:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:32,569 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2025-01-09 22:34:32,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:34:32,569 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2025-01-09 22:34:32,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:34:32,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:32,569 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-01-09 22:34:32,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:32,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:32,775 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:32,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash 16936536, now seen corresponding path program 1 times [2025-01-09 22:34:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:32,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979739833] [2025-01-09 22:34:32,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:32,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:32,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:34:32,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:34:32,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:32,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:32,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:32,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979739833] [2025-01-09 22:34:32,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979739833] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:32,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452115750] [2025-01-09 22:34:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:32,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:32,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:32,891 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:32,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-09 22:34:32,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:34:32,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:34:32,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:32,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:32,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 22:34:32,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:32,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:32,991 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 16 treesize of output 8 [2025-01-09 22:34:32,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:32,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:33,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2025-01-09 22:34:33,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:33,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452115750] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:33,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:33,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 12 [2025-01-09 22:34:33,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103488374] [2025-01-09 22:34:33,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:33,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:34:33,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:33,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:34:33,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:34:33,033 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 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-01-09 22:34:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:33,108 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2025-01-09 22:34:33,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:34:33,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 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 32 [2025-01-09 22:34:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:33,109 INFO L225 Difference]: With dead ends: 71 [2025-01-09 22:34:33,109 INFO L226 Difference]: Without dead ends: 71 [2025-01-09 22:34:33,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 22:34:33,111 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:33,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-01-09 22:34:33,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-01-09 22:34:33,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 65 states have internal predecessors, (76), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2025-01-09 22:34:33,113 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 32 [2025-01-09 22:34:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:33,114 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2025-01-09 22:34:33,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 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-01-09 22:34:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2025-01-09 22:34:33,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:34:33,114 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:33,114 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:33,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:33,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:33,315 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:33,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash 519274841, now seen corresponding path program 2 times [2025-01-09 22:34:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:33,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027507350] [2025-01-09 22:34:33,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:33,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:33,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 22:34:33,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:34:33,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:33,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:33,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:33,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027507350] [2025-01-09 22:34:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027507350] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:33,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139909725] [2025-01-09 22:34:33,672 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:33,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:33,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:33,674 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:33,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-09 22:34:33,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-01-09 22:34:33,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:34:33,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:33,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:33,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 22:34:33,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:33,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:33,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:33,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:33,869 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:33,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:33,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:34:33,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:34:34,193 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:34:34,201 INFO L349 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2025-01-09 22:34:34,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 31 [2025-01-09 22:34:34,209 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:34:34,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 16 [2025-01-09 22:34:34,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:34,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:34,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:34,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1588 treesize of output 1554 [2025-01-09 22:34:35,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:35,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1600 treesize of output 1610 [2025-01-09 22:34:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139909725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:46,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:46,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 28 [2025-01-09 22:34:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945567535] [2025-01-09 22:34:46,393 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:46,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:34:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:46,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:34:46,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1109, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 22:34:46,394 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:34:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:47,173 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2025-01-09 22:34:47,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:34:47,175 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-01-09 22:34:47,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:47,175 INFO L225 Difference]: With dead ends: 73 [2025-01-09 22:34:47,175 INFO L226 Difference]: Without dead ends: 73 [2025-01-09 22:34:47,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=138, Invalid=1842, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 22:34:47,176 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:47,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 641 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:34:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-01-09 22:34:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-01-09 22:34:47,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.278688524590164) internal successors, (78), 67 states have internal predecessors, (78), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:47,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2025-01-09 22:34:47,178 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 33 [2025-01-09 22:34:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:47,178 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2025-01-09 22:34:47,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 24 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 22:34:47,178 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2025-01-09 22:34:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 22:34:47,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:47,186 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:47,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-09 22:34:47,386 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,SelfDestructingSolverStorable22 [2025-01-09 22:34:47,386 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:47,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:47,386 INFO L85 PathProgramCache]: Analyzing trace with hash 807102012, now seen corresponding path program 2 times [2025-01-09 22:34:47,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:47,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846093148] [2025-01-09 22:34:47,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:47,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:47,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-09 22:34:47,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:34:47,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:47,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:34:47,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:47,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846093148] [2025-01-09 22:34:47,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846093148] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:47,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960588798] [2025-01-09 22:34:47,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:47,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:47,525 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:47,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-01-09 22:34:47,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-09 22:34:47,598 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 22:34:47,598 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:47,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:47,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 22:34:47,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:47,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:47,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:47,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2025-01-09 22:34:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:47,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960588798] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:47,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:47,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-01-09 22:34:47,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589745711] [2025-01-09 22:34:47,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:47,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:34:47,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:47,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:34:47,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2025-01-09 22:34:47,917 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:34:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:48,053 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2025-01-09 22:34:48,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:34:48,054 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 35 [2025-01-09 22:34:48,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:48,054 INFO L225 Difference]: With dead ends: 78 [2025-01-09 22:34:48,054 INFO L226 Difference]: Without dead ends: 78 [2025-01-09 22:34:48,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2025-01-09 22:34:48,055 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:48,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 392 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:34:48,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-01-09 22:34:48,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2025-01-09 22:34:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 72 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2025-01-09 22:34:48,057 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 35 [2025-01-09 22:34:48,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:48,057 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2025-01-09 22:34:48,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.8260869565217392) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:34:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2025-01-09 22:34:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:34:48,060 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:48,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:48,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:48,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-09 22:34:48,261 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:48,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash 99782049, now seen corresponding path program 2 times [2025-01-09 22:34:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448131868] [2025-01-09 22:34:48,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:48,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 22:34:48,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:34:48,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:48,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 22:34:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448131868] [2025-01-09 22:34:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448131868] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670659650] [2025-01-09 22:34:48,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:48,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:48,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:48,372 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:48,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-01-09 22:34:48,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 22:34:48,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:34:48,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:48,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:48,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 22:34:48,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:48,475 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-01-09 22:34:48,494 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:34:48,495 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-01-09 22:34:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:34:48,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:48,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670659650] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:48,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:48,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 11 [2025-01-09 22:34:48,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814179844] [2025-01-09 22:34:48,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:48,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 22:34:48,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:48,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 22:34:48,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:34:48,541 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:48,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:48,639 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-01-09 22:34:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 22:34:48,639 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2025-01-09 22:34:48,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:48,639 INFO L225 Difference]: With dead ends: 77 [2025-01-09 22:34:48,639 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 22:34:48,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=145, Unknown=1, NotChecked=24, Total=210 [2025-01-09 22:34:48,640 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:48,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2025-01-09 22:34:48,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 22:34:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-01-09 22:34:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 66 states have (on average 1.2424242424242424) internal successors, (82), 72 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-09 22:34:48,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2025-01-09 22:34:48,642 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 39 [2025-01-09 22:34:48,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:48,642 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2025-01-09 22:34:48,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2025-01-09 22:34:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-01-09 22:34:48,643 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:48,643 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:48,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:48,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:48,843 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:48,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash 99782050, now seen corresponding path program 2 times [2025-01-09 22:34:48,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:48,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549161155] [2025-01-09 22:34:48,844 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:48,850 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 22:34:48,854 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:34:48,854 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:48,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:49,052 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:49,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:49,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549161155] [2025-01-09 22:34:49,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549161155] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:49,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154374699] [2025-01-09 22:34:49,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:49,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:49,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:49,055 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:49,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-01-09 22:34:49,117 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-01-09 22:34:49,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 22:34:49,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:49,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:49,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 22:34:49,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:49,238 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-01-09 22:34:49,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:49,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:34:49,254 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:49,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:49,317 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2025-01-09 22:34:49,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:49,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154374699] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:49,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:49,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2025-01-09 22:34:49,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181491804] [2025-01-09 22:34:49,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:49,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 22:34:49,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:49,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 22:34:49,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=444, Unknown=1, NotChecked=42, Total=552 [2025-01-09 22:34:49,395 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 20 states have internal predecessors, (60), 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-01-09 22:34:49,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:49,572 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2025-01-09 22:34:49,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:34:49,573 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 20 states have internal predecessors, (60), 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 39 [2025-01-09 22:34:49,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:49,573 INFO L225 Difference]: With dead ends: 89 [2025-01-09 22:34:49,573 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 22:34:49,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=614, Unknown=1, NotChecked=50, Total=756 [2025-01-09 22:34:49,574 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:49,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 420 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 242 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2025-01-09 22:34:49,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 22:34:49,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2025-01-09 22:34:49,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 82 states have internal predecessors, (93), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2025-01-09 22:34:49,576 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 39 [2025-01-09 22:34:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:49,576 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2025-01-09 22:34:49,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.727272727272727) internal successors, (60), 20 states have internal predecessors, (60), 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-01-09 22:34:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2025-01-09 22:34:49,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:34:49,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:49,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:49,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:49,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:49,778 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:49,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:49,778 INFO L85 PathProgramCache]: Analyzing trace with hash 489665709, now seen corresponding path program 3 times [2025-01-09 22:34:49,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:49,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108507156] [2025-01-09 22:34:49,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:34:49,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:49,789 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-01-09 22:34:49,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:49,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:34:49,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:50,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:50,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108507156] [2025-01-09 22:34:50,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108507156] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:50,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048265922] [2025-01-09 22:34:50,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:34:50,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:50,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:50,166 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:50,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-01-09 22:34:50,227 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-01-09 22:34:50,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:50,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:34:50,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:50,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-09 22:34:50,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:50,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:50,289 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:50,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:50,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:50,344 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(#memory_$Pointer$#0.base)| alloc_and_zero_~pi~0.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_~pi~0.base)) |c_#memory_$Pointer$#0.base|))) is different from true [2025-01-09 22:34:50,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:50,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:34:50,359 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:50,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:50,366 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:50,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:34:50,440 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-01-09 22:34:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-01-09 22:34:50,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:50,461 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-01-09 22:34:50,461 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-01-09 22:34:50,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048265922] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:50,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:50,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 27 [2025-01-09 22:34:50,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449644679] [2025-01-09 22:34:50,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:50,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:34:50,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:50,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:34:50,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=731, Unknown=12, NotChecked=54, Total=870 [2025-01-09 22:34:50,537 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:50,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:50,849 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2025-01-09 22:34:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:34:50,850 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 42 [2025-01-09 22:34:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:50,850 INFO L225 Difference]: With dead ends: 92 [2025-01-09 22:34:50,850 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 22:34:50,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=949, Unknown=12, NotChecked=62, Total=1122 [2025-01-09 22:34:50,851 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:50,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 575 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 657 Invalid, 0 Unknown, 69 Unchecked, 0.2s Time] [2025-01-09 22:34:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 22:34:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-01-09 22:34:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.240506329113924) internal successors, (98), 85 states have internal predecessors, (98), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 106 transitions. [2025-01-09 22:34:50,853 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 106 transitions. Word has length 42 [2025-01-09 22:34:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:50,853 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 106 transitions. [2025-01-09 22:34:50,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 23 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 106 transitions. [2025-01-09 22:34:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:34:50,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:50,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:50,860 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-01-09 22:34:51,057 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,SelfDestructingSolverStorable26 [2025-01-09 22:34:51,058 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:51,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:51,058 INFO L85 PathProgramCache]: Analyzing trace with hash 489665710, now seen corresponding path program 2 times [2025-01-09 22:34:51,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:51,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200491883] [2025-01-09 22:34:51,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:51,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:51,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:34:51,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:51,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:51,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:51,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:51,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200491883] [2025-01-09 22:34:51,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200491883] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:51,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949873132] [2025-01-09 22:34:51,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:34:51,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:51,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:51,708 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:51,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-01-09 22:34:51,773 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-01-09 22:34:51,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:51,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:34:51,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:51,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-01-09 22:34:51,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:51,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:51,894 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:51,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:51,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:51,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:52,063 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(#memory_$Pointer$#0.base)| alloc_and_zero_~pi~0.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_~pi~0.base)) |c_#memory_$Pointer$#0.base|) (= (store |c_old(#memory_$Pointer$#0.offset)| alloc_and_zero_~pi~0.base (select |c_#memory_$Pointer$#0.offset| alloc_and_zero_~pi~0.base)) |c_#memory_$Pointer$#0.offset|))) is different from true [2025-01-09 22:34:52,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:52,077 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 17 [2025-01-09 22:34:52,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:52,080 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-01-09 22:34:52,087 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:52,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:52,126 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:34:52,126 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 56 treesize of output 51 [2025-01-09 22:34:52,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2025-01-09 22:34:52,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-01-09 22:34:52,253 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 26 treesize of output 14 [2025-01-09 22:34:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-01-09 22:34:52,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:52,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:52,437 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 44 [2025-01-09 22:34:52,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949873132] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:52,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:52,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 36 [2025-01-09 22:34:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58245566] [2025-01-09 22:34:52,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:52,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 22:34:52,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:52,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 22:34:52,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1519, Unknown=18, NotChecked=78, Total=1722 [2025-01-09 22:34:52,642 INFO L87 Difference]: Start difference. First operand 91 states and 106 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:34:53,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:53,291 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2025-01-09 22:34:53,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 22:34:53,292 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 42 [2025-01-09 22:34:53,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:53,292 INFO L225 Difference]: With dead ends: 92 [2025-01-09 22:34:53,292 INFO L226 Difference]: Without dead ends: 92 [2025-01-09 22:34:53,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=173, Invalid=2361, Unknown=20, NotChecked=98, Total=2652 [2025-01-09 22:34:53,293 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 7 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:53,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 836 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 803 Invalid, 0 Unknown, 68 Unchecked, 0.3s Time] [2025-01-09 22:34:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-01-09 22:34:53,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2025-01-09 22:34:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 85 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:53,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2025-01-09 22:34:53,295 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 42 [2025-01-09 22:34:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:53,295 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2025-01-09 22:34:53,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:34:53,296 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2025-01-09 22:34:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:34:53,296 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:53,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:53,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:53,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:53,500 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2001087008, now seen corresponding path program 1 times [2025-01-09 22:34:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:53,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386332370] [2025-01-09 22:34:53,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:53,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:53,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:34:53,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:34:53,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:53,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:53,744 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:34:53,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:53,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386332370] [2025-01-09 22:34:53,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386332370] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:53,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608265820] [2025-01-09 22:34:53,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:53,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:53,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:53,746 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-01-09 22:34:53,748 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-01-09 22:34:53,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:34:53,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:34:53,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:53,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:53,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-01-09 22:34:53,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:53,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:34:53,946 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:34:53,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:34:53,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:54,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:54,147 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 25 treesize of output 21 [2025-01-09 22:34:54,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:34:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:34:54,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:54,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:54,343 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-01-09 22:34:54,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 30 treesize of output 26 [2025-01-09 22:34:54,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:34:54,461 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 16 treesize of output 12 [2025-01-09 22:34:54,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608265820] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:54,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:34:54,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 33 [2025-01-09 22:34:54,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210765729] [2025-01-09 22:34:54,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:54,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-01-09 22:34:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:54,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-01-09 22:34:54,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1543, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 22:34:54,575 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 29 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:55,198 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2025-01-09 22:34:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:34:55,201 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 29 states have internal predecessors, (64), 3 states have call successors, (3), 2 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 41 [2025-01-09 22:34:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:55,202 INFO L225 Difference]: With dead ends: 95 [2025-01-09 22:34:55,202 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 22:34:55,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=2784, Unknown=0, NotChecked=0, Total=2970 [2025-01-09 22:34:55,203 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:55,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 408 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 22:34:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-01-09 22:34:55,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 89 states have internal predecessors, (103), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:55,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2025-01-09 22:34:55,205 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 41 [2025-01-09 22:34:55,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:55,205 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2025-01-09 22:34:55,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 29 states have internal predecessors, (64), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2025-01-09 22:34:55,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:34:55,206 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:55,206 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:55,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:55,406 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,SelfDestructingSolverStorable28 [2025-01-09 22:34:55,407 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:55,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2001087007, now seen corresponding path program 1 times [2025-01-09 22:34:55,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:55,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581766941] [2025-01-09 22:34:55,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:55,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:55,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:34:55,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:34:55,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:55,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:34:55,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581766941] [2025-01-09 22:34:55,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581766941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:55,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983866426] [2025-01-09 22:34:55,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:55,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:55,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:55,609 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-01-09 22:34:55,615 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-01-09 22:34:55,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:34:55,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:34:55,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:55,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:55,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-01-09 22:34:55,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:55,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:34:55,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:34:55,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:55,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-01-09 22:34:55,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:55,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-01-09 22:34:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:34:56,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:56,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:56,261 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 29 treesize of output 33 [2025-01-09 22:34:56,449 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:34:56,449 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 79 treesize of output 66 [2025-01-09 22:34:56,466 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 28 treesize of output 24 [2025-01-09 22:34:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:34:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983866426] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:56,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 19] total 43 [2025-01-09 22:34:56,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792934945] [2025-01-09 22:34:56,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:56,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 22:34:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:56,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 22:34:56,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1773, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 22:34:56,656 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 39 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:34:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:57,350 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2025-01-09 22:34:57,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:34:57,350 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 39 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2025-01-09 22:34:57,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:57,351 INFO L225 Difference]: With dead ends: 97 [2025-01-09 22:34:57,351 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 22:34:57,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=2879, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 22:34:57,352 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 23 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:57,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 702 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:34:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 22:34:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 22:34:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.223529411764706) internal successors, (104), 91 states have internal predecessors, (104), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2025-01-09 22:34:57,360 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 41 [2025-01-09 22:34:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:57,360 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2025-01-09 22:34:57,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.186046511627907) internal successors, (94), 39 states have internal predecessors, (94), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-09 22:34:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2025-01-09 22:34:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 22:34:57,361 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:57,361 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:57,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:57,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:57,561 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:57,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:57,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1904143133, now seen corresponding path program 1 times [2025-01-09 22:34:57,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:57,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164937714] [2025-01-09 22:34:57,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:57,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:57,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:57,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:57,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:57,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:34:57,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164937714] [2025-01-09 22:34:57,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164937714] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:57,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631413534] [2025-01-09 22:34:57,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:34:57,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:57,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:57,725 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:57,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-01-09 22:34:57,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 22:34:57,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 22:34:57,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:34:57,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:57,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 22:34:57,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:58,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:58,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2025-01-09 22:34:58,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:58,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2025-01-09 22:34:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:58,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:58,441 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 22:34:58,441 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-01-09 22:34:58,448 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2025-01-09 22:34:58,448 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 7 [2025-01-09 22:34:58,554 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:34:58,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631413534] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:58,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:58,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 39 [2025-01-09 22:34:58,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082075934] [2025-01-09 22:34:58,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:58,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-01-09 22:34:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:58,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-01-09 22:34:58,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1380, Unknown=0, NotChecked=0, Total=1482 [2025-01-09 22:34:58,556 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 37 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:59,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:59,308 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2025-01-09 22:34:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 22:34:59,309 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 37 states have internal predecessors, (80), 3 states have call successors, (3), 1 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 42 [2025-01-09 22:34:59,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:59,309 INFO L225 Difference]: With dead ends: 108 [2025-01-09 22:34:59,309 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 22:34:59,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 54 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=3297, Unknown=0, NotChecked=0, Total=3540 [2025-01-09 22:34:59,310 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:59,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 604 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:34:59,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 22:34:59,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2025-01-09 22:34:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.206896551724138) internal successors, (105), 93 states have internal predecessors, (105), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2025-01-09 22:34:59,313 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 42 [2025-01-09 22:34:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:59,313 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2025-01-09 22:34:59,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 37 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:34:59,313 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2025-01-09 22:34:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:34:59,313 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:59,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:59,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:59,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-01-09 22:34:59,517 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:59,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:59,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1877470064, now seen corresponding path program 3 times [2025-01-09 22:34:59,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:59,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362410223] [2025-01-09 22:34:59,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:34:59,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:34:59,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-01-09 22:34:59,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 44 statements. [2025-01-09 22:34:59,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:34:59,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 22:34:59,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:34:59,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362410223] [2025-01-09 22:34:59,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362410223] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:34:59,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129440673] [2025-01-09 22:34:59,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:34:59,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:59,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:34:59,591 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:34:59,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-01-09 22:34:59,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 3 equivalence classes. [2025-01-09 22:34:59,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 35 of 44 statements. [2025-01-09 22:34:59,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 22:34:59,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:34:59,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 22:34:59,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:34:59,704 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 22:34:59,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:34:59,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:34:59,721 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-01-09 22:34:59,748 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 22:34:59,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129440673] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:34:59,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:34:59,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 22:34:59,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180550359] [2025-01-09 22:34:59,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:34:59,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:34:59,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:34:59,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:34:59,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:59,749 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:34:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:34:59,783 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2025-01-09 22:34:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:34:59,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-01-09 22:34:59,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:34:59,783 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:34:59,784 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:34:59,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:34:59,784 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:34:59,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:34:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:34:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-01-09 22:34:59,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 93 states have internal predecessors, (103), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:34:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2025-01-09 22:34:59,795 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 44 [2025-01-09 22:34:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:34:59,795 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2025-01-09 22:34:59,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-01-09 22:34:59,795 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2025-01-09 22:34:59,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:34:59,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:34:59,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:34:59,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-01-09 22:34:59,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:34:59,996 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:34:59,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:34:59,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1922212385, now seen corresponding path program 4 times [2025-01-09 22:34:59,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:34:59,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221810723] [2025-01-09 22:34:59,997 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:34:59,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:00,015 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-09 22:35:00,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 42 of 45 statements. [2025-01-09 22:35:00,019 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:35:00,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221810723] [2025-01-09 22:35:00,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221810723] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228432628] [2025-01-09 22:35:00,520 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:35:00,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:00,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:00,522 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:00,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-01-09 22:35:00,597 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-01-09 22:35:00,617 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 42 of 45 statements. [2025-01-09 22:35:00,617 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:35:00,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:00,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-01-09 22:35:00,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:00,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:35:00,743 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:35:00,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:35:00,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:00,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:35:00,975 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:35:00,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:35:00,981 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 17 [2025-01-09 22:35:00,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:35:01,034 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-01-09 22:35:01,034 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 77 treesize of output 51 [2025-01-09 22:35:01,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-01-09 22:35:01,203 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 7 treesize of output 3 [2025-01-09 22:35:01,323 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 22:35:01,323 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 20 [2025-01-09 22:35:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:01,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:01,821 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1003 (Array Int Int)) (|v_ULTIMATE.start_loop_~node~0#1.offset_75| Int) (v_ArrVal_1010 (Array Int Int)) (|v_ULTIMATE.start_create_#t~ret6#1.base_97| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_97|) 0)) (< |v_ULTIMATE.start_loop_~node~0#1.offset_75| 0) (< (select (select (store (store |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_create_#t~ret6#1.base_97| v_ArrVal_1010) |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|) |v_ULTIMATE.start_loop_~node~0#1.offset_75|) (= (select (store |c_#valid| |v_ULTIMATE.start_create_#t~ret6#1.base_97| 1) (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret6#1.base_97| v_ArrVal_1009))) (store .cse1 |c_ULTIMATE.start_create_~now~0#1.base| (store (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| |v_ULTIMATE.start_create_#t~ret6#1.base_97|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_create_~sll~0#1.base|) |c_ULTIMATE.start_create_~sll~0#1.offset|))) |v_ULTIMATE.start_loop_~node~0#1.offset_75|)) 1))) is different from false [2025-01-09 22:35:01,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228432628] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:01,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:01,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2025-01-09 22:35:01,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735714734] [2025-01-09 22:35:01,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:01,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-01-09 22:35:01,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:01,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-01-09 22:35:01,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=2590, Unknown=13, NotChecked=102, Total=2862 [2025-01-09 22:35:01,823 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 47 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 39 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:35:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:02,517 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2025-01-09 22:35:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:35:02,517 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 39 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2025-01-09 22:35:02,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:02,518 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:35:02,518 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:35:02,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=3323, Unknown=13, NotChecked=116, Total=3660 [2025-01-09 22:35:02,519 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 6 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:02,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 808 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:35:02,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:35:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-01-09 22:35:02,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.2) internal successors, (108), 96 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-01-09 22:35:02,521 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 45 [2025-01-09 22:35:02,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:02,521 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-01-09 22:35:02,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 39 states have internal predecessors, (76), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:35:02,521 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-01-09 22:35:02,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-09 22:35:02,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:02,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:02,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-01-09 22:35:02,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-01-09 22:35:02,726 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:02,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:02,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1922212386, now seen corresponding path program 3 times [2025-01-09 22:35:02,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:02,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171336019] [2025-01-09 22:35:02,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:35:02,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:02,732 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-01-09 22:35:02,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:35:02,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:35:02,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:03,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171336019] [2025-01-09 22:35:03,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171336019] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:03,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931158387] [2025-01-09 22:35:03,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:35:03,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:03,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:03,363 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:03,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-01-09 22:35:03,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-01-09 22:35:03,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 22:35:03,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:35:03,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:03,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 110 conjuncts are in the unsatisfiable core [2025-01-09 22:35:03,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:03,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:35:03,633 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:35:03,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:35:03,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:03,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:35:03,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:35:03,853 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:35:03,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 21 [2025-01-09 22:35:03,856 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 12 treesize of output 8 [2025-01-09 22:35:03,864 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:35:03,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:35:03,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:35:03,920 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-01-09 22:35:03,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 54 [2025-01-09 22:35:03,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-01-09 22:35:04,355 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:04,356 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:04,356 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:04,365 INFO L349 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2025-01-09 22:35:04,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 44 [2025-01-09 22:35:04,370 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:35:04,374 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-01-09 22:35:04,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2025-01-09 22:35:04,380 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:04,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:05,000 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 365 treesize of output 309 [2025-01-09 22:35:05,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931158387] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:05,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:05,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 43 [2025-01-09 22:35:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576321413] [2025-01-09 22:35:05,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:05,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 22:35:05,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:05,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 22:35:05,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2610, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 22:35:05,289 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 36 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:35:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:06,054 INFO L93 Difference]: Finished difference Result 103 states and 117 transitions. [2025-01-09 22:35:06,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:35:06,055 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 36 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2025-01-09 22:35:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:06,055 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:35:06,055 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:35:06,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=188, Invalid=3234, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 22:35:06,056 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:06,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 967 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:35:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:35:06,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-01-09 22:35:06,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 90 states have (on average 1.1888888888888889) internal successors, (107), 96 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-01-09 22:35:06,059 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 45 [2025-01-09 22:35:06,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:06,059 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-01-09 22:35:06,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.6511627906976745) internal successors, (71), 36 states have internal predecessors, (71), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:35:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-01-09 22:35:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:35:06,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:06,059 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:06,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2025-01-09 22:35:06,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-01-09 22:35:06,260 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:06,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash -236961959, now seen corresponding path program 1 times [2025-01-09 22:35:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:06,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722578275] [2025-01-09 22:35:06,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:06,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:06,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:35:06,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:35:06,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:06,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 22:35:06,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722578275] [2025-01-09 22:35:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722578275] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453969146] [2025-01-09 22:35:06,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:06,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:06,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:06,407 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:06,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-01-09 22:35:06,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:35:06,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:35:06,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:06,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:06,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-01-09 22:35:06,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:06,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:06,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:06,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2025-01-09 22:35:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:35:06,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:06,944 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 28 treesize of output 24 [2025-01-09 22:35:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 22:35:07,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453969146] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:35:07,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:35:07,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 32 [2025-01-09 22:35:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806341351] [2025-01-09 22:35:07,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:07,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-01-09 22:35:07,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:07,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-01-09 22:35:07,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=972, Unknown=0, NotChecked=0, Total=1056 [2025-01-09 22:35:07,068 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 33 states, 32 states have (on average 2.46875) internal successors, (79), 29 states have internal predecessors, (79), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:35:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:07,462 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2025-01-09 22:35:07,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:35:07,463 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 29 states have internal predecessors, (79), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2025-01-09 22:35:07,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:07,463 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:35:07,463 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:35:07,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 58 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1662, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 22:35:07,464 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:07,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 523 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:35:07,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:35:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 22:35:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 97 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:07,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2025-01-09 22:35:07,467 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 44 [2025-01-09 22:35:07,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:07,467 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2025-01-09 22:35:07,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.46875) internal successors, (79), 29 states have internal predecessors, (79), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-01-09 22:35:07,467 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2025-01-09 22:35:07,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 22:35:07,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:07,467 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:07,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-01-09 22:35:07,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:07,668 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash -362467345, now seen corresponding path program 1 times [2025-01-09 22:35:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:07,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607161047] [2025-01-09 22:35:07,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:07,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:35:07,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:35:07,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:07,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:07,723 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:35:07,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:07,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607161047] [2025-01-09 22:35:07,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607161047] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:07,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109824670] [2025-01-09 22:35:07,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:35:07,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:07,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:07,729 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:07,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-01-09 22:35:07,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 22:35:07,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 22:35:07,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:35:07,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:07,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 22:35:07,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:07,907 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:35:07,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 22:35:08,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109824670] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:35:08,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:35:08,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 15 [2025-01-09 22:35:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599623627] [2025-01-09 22:35:08,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:08,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 22:35:08,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:08,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 22:35:08,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:35:08,001 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:35:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:08,032 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-01-09 22:35:08,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:35:08,032 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 1 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 46 [2025-01-09 22:35:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:08,032 INFO L225 Difference]: With dead ends: 103 [2025-01-09 22:35:08,032 INFO L226 Difference]: Without dead ends: 103 [2025-01-09 22:35:08,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-01-09 22:35:08,033 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:08,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:35:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-01-09 22:35:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-01-09 22:35:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.164835164835165) internal successors, (106), 97 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2025-01-09 22:35:08,037 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 46 [2025-01-09 22:35:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:08,037 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2025-01-09 22:35:08,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:35:08,037 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2025-01-09 22:35:08,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:35:08,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:08,038 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:08,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-01-09 22:35:08,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-01-09 22:35:08,239 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:08,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:08,239 INFO L85 PathProgramCache]: Analyzing trace with hash -169783251, now seen corresponding path program 5 times [2025-01-09 22:35:08,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:08,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040522097] [2025-01-09 22:35:08,239 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:35:08,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:08,250 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 4 equivalence classes. [2025-01-09 22:35:08,259 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:35:08,259 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 22:35:08,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:09,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:09,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040522097] [2025-01-09 22:35:09,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040522097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:09,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353169317] [2025-01-09 22:35:09,168 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 22:35:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:09,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:09,170 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:09,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-01-09 22:35:09,261 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 4 equivalence classes. [2025-01-09 22:35:09,286 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:35:09,286 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-01-09 22:35:09,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:09,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-01-09 22:35:09,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:09,544 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:35:09,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:35:09,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:09,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:35:09,897 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 22:35:09,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 22:35:09,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:09,903 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 36 treesize of output 27 [2025-01-09 22:35:09,917 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-01-09 22:35:09,918 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-01-09 22:35:10,006 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2025-01-09 22:35:10,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 81 [2025-01-09 22:35:10,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2025-01-09 22:35:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:10,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:16,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353169317] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:16,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:16,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 53 [2025-01-09 22:35:16,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530010038] [2025-01-09 22:35:16,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:16,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-01-09 22:35:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:16,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-01-09 22:35:16,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3616, Unknown=1, NotChecked=0, Total=3782 [2025-01-09 22:35:16,300 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 44 states have internal predecessors, (79), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:35:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:17,722 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2025-01-09 22:35:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 22:35:17,723 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 44 states have internal predecessors, (79), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2025-01-09 22:35:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:17,724 INFO L225 Difference]: With dead ends: 106 [2025-01-09 22:35:17,724 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:35:17,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=246, Invalid=5155, Unknown=1, NotChecked=0, Total=5402 [2025-01-09 22:35:17,725 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:17,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1257 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:35:17,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:35:17,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-01-09 22:35:17,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 99 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:17,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2025-01-09 22:35:17,728 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 48 [2025-01-09 22:35:17,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:17,728 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2025-01-09 22:35:17,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 44 states have internal predecessors, (79), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 22:35:17,728 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2025-01-09 22:35:17,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:35:17,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:17,728 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:17,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-01-09 22:35:17,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-01-09 22:35:17,931 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:17,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1592604101, now seen corresponding path program 2 times [2025-01-09 22:35:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:17,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585585917] [2025-01-09 22:35:17,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:35:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:17,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-09 22:35:17,947 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:35:17,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:35:17,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:35:18,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585585917] [2025-01-09 22:35:18,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585585917] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:18,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075098272] [2025-01-09 22:35:18,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:35:18,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:18,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:18,364 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:18,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-01-09 22:35:18,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-01-09 22:35:18,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:35:18,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:35:18,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:18,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-01-09 22:35:18,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:18,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:18,876 INFO L349 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2025-01-09 22:35:18,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2025-01-09 22:35:18,894 INFO L349 Elim1Store]: treesize reduction 17, result has 48.5 percent of original size [2025-01-09 22:35:18,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2025-01-09 22:35:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 22:35:18,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:19,556 INFO L349 Elim1Store]: treesize reduction 23, result has 74.7 percent of original size [2025-01-09 22:35:19,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 113 [2025-01-09 22:35:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:35:20,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075098272] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:35:20,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:35:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 16] total 46 [2025-01-09 22:35:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905287976] [2025-01-09 22:35:20,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:20,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 22:35:20,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:20,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 22:35:20,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1935, Unknown=2, NotChecked=0, Total=2070 [2025-01-09 22:35:20,062 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 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-01-09 22:35:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:21,136 INFO L93 Difference]: Finished difference Result 125 states and 143 transitions. [2025-01-09 22:35:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 22:35:21,136 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 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 47 [2025-01-09 22:35:21,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:21,137 INFO L225 Difference]: With dead ends: 125 [2025-01-09 22:35:21,137 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 22:35:21,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=252, Invalid=3778, Unknown=2, NotChecked=0, Total=4032 [2025-01-09 22:35:21,138 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:21,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 608 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 22:35:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 22:35:21,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2025-01-09 22:35:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 109 states have internal predecessors, (125), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2025-01-09 22:35:21,141 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 47 [2025-01-09 22:35:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:21,141 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2025-01-09 22:35:21,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 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-01-09 22:35:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2025-01-09 22:35:21,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-09 22:35:21,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:21,141 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:21,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-01-09 22:35:21,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-01-09 22:35:21,346 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:21,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2126098846, now seen corresponding path program 2 times [2025-01-09 22:35:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446514545] [2025-01-09 22:35:21,347 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:35:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:21,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 22:35:21,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:35:21,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:35:21,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:35:22,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446514545] [2025-01-09 22:35:22,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446514545] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337294926] [2025-01-09 22:35:22,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:35:22,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:22,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:22,157 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:22,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-01-09 22:35:22,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-01-09 22:35:22,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 22:35:22,276 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:35:22,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:22,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-01-09 22:35:22,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:22,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:22,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2025-01-09 22:35:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 22:35:22,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:23,242 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 88 treesize of output 80 [2025-01-09 22:35:23,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337294926] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:23,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:23,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 37 [2025-01-09 22:35:23,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261796245] [2025-01-09 22:35:23,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:23,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-01-09 22:35:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:23,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-01-09 22:35:23,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2031, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 22:35:23,578 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 33 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:35:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:24,483 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2025-01-09 22:35:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:35:24,483 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 33 states have internal predecessors, (79), 3 states have call successors, (3), 1 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 48 [2025-01-09 22:35:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:24,484 INFO L225 Difference]: With dead ends: 124 [2025-01-09 22:35:24,484 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:35:24,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=199, Invalid=3107, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 22:35:24,485 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:24,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 428 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 22:35:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:35:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:35:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 93 states have internal predecessors, (108), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2025-01-09 22:35:24,487 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 48 [2025-01-09 22:35:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:24,487 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2025-01-09 22:35:24,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.135135135135135) internal successors, (79), 33 states have internal predecessors, (79), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 22:35:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2025-01-09 22:35:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:35:24,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:24,488 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:24,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-01-09 22:35:24,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-09 22:35:24,688 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:24,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash 26736746, now seen corresponding path program 3 times [2025-01-09 22:35:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:24,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339725644] [2025-01-09 22:35:24,691 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:35:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:24,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-01-09 22:35:24,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:35:24,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 22:35:24,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 38 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 22:35:25,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:25,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339725644] [2025-01-09 22:35:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339725644] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1094070486] [2025-01-09 22:35:25,022 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:35:25,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:25,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:25,024 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:25,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-01-09 22:35:25,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 4 equivalence classes. [2025-01-09 22:35:25,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:35:25,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-01-09 22:35:25,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:25,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 22:35:25,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:25,305 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))) (= (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-01-09 22:35:25,338 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:35:25,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 19 treesize of output 16 [2025-01-09 22:35:25,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:35:25,375 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-01-09 22:35:25,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:25,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-01-09 22:35:25,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:35:25,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:35:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 12 proven. 25 refuted. 0 times theorem prover too weak. 8 trivial. 12 not checked. [2025-01-09 22:35:25,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1094070486] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:25,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:25,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 26 [2025-01-09 22:35:25,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382121168] [2025-01-09 22:35:25,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:25,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 22:35:25,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:25,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 22:35:25,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=578, Unknown=2, NotChecked=98, Total=756 [2025-01-09 22:35:25,549 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 23 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 22:35:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:25,731 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2025-01-09 22:35:25,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:35:25,731 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 23 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 51 [2025-01-09 22:35:25,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:25,732 INFO L225 Difference]: With dead ends: 99 [2025-01-09 22:35:25,732 INFO L226 Difference]: Without dead ends: 99 [2025-01-09 22:35:25,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=769, Unknown=2, NotChecked=114, Total=992 [2025-01-09 22:35:25,732 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:25,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 387 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 209 Invalid, 0 Unknown, 90 Unchecked, 0.1s Time] [2025-01-09 22:35:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-01-09 22:35:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-01-09 22:35:25,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 93 states have internal predecessors, (107), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:25,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2025-01-09 22:35:25,734 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 51 [2025-01-09 22:35:25,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:25,734 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2025-01-09 22:35:25,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 23 states have internal predecessors, (70), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-01-09 22:35:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2025-01-09 22:35:25,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-09 22:35:25,734 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:25,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-01-09 22:35:25,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-01-09 22:35:25,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-01-09 22:35:25,935 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:25,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1654169585, now seen corresponding path program 3 times [2025-01-09 22:35:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:25,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246691446] [2025-01-09 22:35:25,935 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:35:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:25,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 3 equivalence classes. [2025-01-09 22:35:25,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:35:25,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:35:25,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:35:26,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246691446] [2025-01-09 22:35:26,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246691446] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:26,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239593022] [2025-01-09 22:35:26,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:35:26,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:26,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:26,355 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:26,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-01-09 22:35:26,450 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 51 statements into 3 equivalence classes. [2025-01-09 22:35:26,479 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 22:35:26,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:35:26,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:26,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-01-09 22:35:26,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:26,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:35:26,541 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:35:26,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:35:26,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:26,643 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(#memory_$Pointer$#0.base)| alloc_and_zero_~pi~0.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_~pi~0.base)) |c_#memory_$Pointer$#0.base|))) is different from true [2025-01-09 22:35:26,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:26,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-01-09 22:35:26,657 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:35:26,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:35:26,681 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:35:26,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2025-01-09 22:35:26,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:26,755 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 20 [2025-01-09 22:35:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-01-09 22:35:26,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:27,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239593022] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:27,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:27,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 35 [2025-01-09 22:35:27,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099697011] [2025-01-09 22:35:27,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:27,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 22:35:27,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:27,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 22:35:27,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1664, Unknown=2, NotChecked=82, Total=1892 [2025-01-09 22:35:27,096 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 29 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:27,473 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2025-01-09 22:35:27,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:35:27,474 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 29 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2025-01-09 22:35:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:27,474 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:35:27,474 INFO L226 Difference]: Without dead ends: 100 [2025-01-09 22:35:27,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=180, Invalid=2174, Unknown=2, NotChecked=94, Total=2450 [2025-01-09 22:35:27,475 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:27,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 628 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 568 Invalid, 0 Unknown, 65 Unchecked, 0.2s Time] [2025-01-09 22:35:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-01-09 22:35:27,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-01-09 22:35:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 93 states have internal predecessors, (106), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2025-01-09 22:35:27,477 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 51 [2025-01-09 22:35:27,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:27,477 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2025-01-09 22:35:27,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.085714285714286) internal successors, (73), 29 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-01-09 22:35:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2025-01-09 22:35:27,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:35:27,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:27,480 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:27,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-01-09 22:35:27,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2025-01-09 22:35:27,680 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:27,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1945433317, now seen corresponding path program 6 times [2025-01-09 22:35:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:27,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860089215] [2025-01-09 22:35:27,681 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:35:27,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:27,693 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 4 equivalence classes. [2025-01-09 22:35:27,705 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:35:27,706 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-09 22:35:27,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:35:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860089215] [2025-01-09 22:35:28,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860089215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114398025] [2025-01-09 22:35:28,560 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 22:35:28,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:28,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:28,562 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:28,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-01-09 22:35:28,672 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 4 equivalence classes. [2025-01-09 22:35:28,719 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 22:35:28,719 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-01-09 22:35:28,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:28,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-01-09 22:35:28,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:28,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:35:28,954 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 22:35:28,954 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-01-09 22:35:28,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:29,266 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:35:29,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:35:29,275 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 17 [2025-01-09 22:35:29,342 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-01-09 22:35:29,343 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 31 treesize of output 15 [2025-01-09 22:35:29,589 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 1)) (= (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_~pi~0.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_~pi~0.base)) |c_#memory_$Pointer$#0.base|))) is different from true [2025-01-09 22:35:29,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:29,610 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-01-09 22:35:29,610 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 47 [2025-01-09 22:35:29,643 INFO L349 Elim1Store]: treesize reduction 110, result has 32.1 percent of original size [2025-01-09 22:35:29,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 69 [2025-01-09 22:35:29,746 INFO L349 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-01-09 22:35:29,746 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 72 [2025-01-09 22:35:29,753 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 29 treesize of output 21 [2025-01-09 22:35:30,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-01-09 22:35:30,138 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2025-01-09 22:35:30,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:30,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114398025] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:30,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:30,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28] total 56 [2025-01-09 22:35:30,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160315886] [2025-01-09 22:35:30,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:30,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-01-09 22:35:30,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:30,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-01-09 22:35:30,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3571, Unknown=2, NotChecked=120, Total=3906 [2025-01-09 22:35:30,421 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 47 states have internal predecessors, (90), 7 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:35:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:31,335 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2025-01-09 22:35:31,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 22:35:31,335 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 47 states have internal predecessors, (90), 7 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 54 [2025-01-09 22:35:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:31,336 INFO L225 Difference]: With dead ends: 115 [2025-01-09 22:35:31,336 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 22:35:31,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=308, Invalid=4806, Unknown=2, NotChecked=140, Total=5256 [2025-01-09 22:35:31,340 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:31,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 875 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1269 Invalid, 0 Unknown, 84 Unchecked, 0.6s Time] [2025-01-09 22:35:31,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 22:35:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-01-09 22:35:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.22) internal successors, (122), 106 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:35:31,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2025-01-09 22:35:31,348 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 54 [2025-01-09 22:35:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:31,348 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2025-01-09 22:35:31,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 47 states have internal predecessors, (90), 7 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:35:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2025-01-09 22:35:31,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-09 22:35:31,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:31,349 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:31,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-01-09 22:35:31,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,34 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:31,550 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:31,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:31,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1945433318, now seen corresponding path program 4 times [2025-01-09 22:35:31,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:31,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543583195] [2025-01-09 22:35:31,551 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:35:31,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:31,559 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-01-09 22:35:31,566 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 54 statements. [2025-01-09 22:35:31,566 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:35:31,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 6 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:32,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543583195] [2025-01-09 22:35:32,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543583195] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:32,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68241465] [2025-01-09 22:35:32,603 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 22:35:32,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:32,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:32,605 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:32,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-01-09 22:35:32,706 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-01-09 22:35:32,732 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 54 statements. [2025-01-09 22:35:32,732 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 22:35:32,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:32,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 144 conjuncts are in the unsatisfiable core [2025-01-09 22:35:32,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:32,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:35:32,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:35:32,994 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 22:35:32,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 22:35:33,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:35:33,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:33,444 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 22:35:33,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 22:35:33,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 22:35:33,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:33,455 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 42 treesize of output 31 [2025-01-09 22:35:33,466 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:35:33,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-01-09 22:35:33,493 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-01-09 22:35:33,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-01-09 22:35:33,576 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-01-09 22:35:33,576 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 19 treesize of output 18 [2025-01-09 22:35:33,594 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-01-09 22:35:33,594 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 61 treesize of output 33 [2025-01-09 22:35:50,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:50,176 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-01-09 22:35:50,177 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 71 [2025-01-09 22:35:50,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:50,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:50,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2025-01-09 22:35:50,208 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-01-09 22:35:50,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-01-09 22:35:50,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-01-09 22:35:50,318 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2025-01-09 22:35:50,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 81 [2025-01-09 22:35:50,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2025-01-09 22:35:50,670 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-01-09 22:35:50,671 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 38 [2025-01-09 22:35:50,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 22:35:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 13 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 22:35:50,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:51,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68241465] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:51,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:51,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 54 [2025-01-09 22:35:51,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233482416] [2025-01-09 22:35:51,166 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:51,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-01-09 22:35:51,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:51,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-01-09 22:35:51,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=3538, Unknown=5, NotChecked=0, Total=3782 [2025-01-09 22:35:51,169 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand has 55 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 44 states have internal predecessors, (87), 7 states have call successors, (7), 4 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:35:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:52,325 INFO L93 Difference]: Finished difference Result 114 states and 133 transitions. [2025-01-09 22:35:52,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:35:52,325 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 44 states have internal predecessors, (87), 7 states have call successors, (7), 4 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 54 [2025-01-09 22:35:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:52,326 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:35:52,327 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:35:52,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=339, Invalid=4626, Unknown=5, NotChecked=0, Total=4970 [2025-01-09 22:35:52,329 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 1276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:52,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1000 Invalid, 1276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 22:35:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:35:52,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-01-09 22:35:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.21) internal successors, (121), 106 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:35:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2025-01-09 22:35:52,341 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 54 [2025-01-09 22:35:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:52,341 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2025-01-09 22:35:52,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 44 states have internal predecessors, (87), 7 states have call successors, (7), 4 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2025-01-09 22:35:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2025-01-09 22:35:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:35:52,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:52,342 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:52,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-01-09 22:35:52,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,35 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:52,542 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:52,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:52,543 INFO L85 PathProgramCache]: Analyzing trace with hash 816819880, now seen corresponding path program 3 times [2025-01-09 22:35:52,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:52,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33136595] [2025-01-09 22:35:52,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:35:52,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:52,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 3 equivalence classes. [2025-01-09 22:35:52,557 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:35:52,557 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:35:52,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:35:53,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:35:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33136595] [2025-01-09 22:35:53,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33136595] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:53,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525894405] [2025-01-09 22:35:53,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:35:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:35:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:35:53,258 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:35:53,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-01-09 22:35:53,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 53 statements into 3 equivalence classes. [2025-01-09 22:35:53,392 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:35:53,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 22:35:53,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:35:53,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-01-09 22:35:53,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:35:53,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:35:53,453 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:35:53,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:35:53,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 22:35:53,657 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(#memory_$Pointer$#0.base)| alloc_and_zero_~pi~0.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_~pi~0.base)) |c_#memory_$Pointer$#0.base|))) is different from true [2025-01-09 22:35:53,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:35:53,670 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 17 [2025-01-09 22:35:53,680 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:35:53,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:35:53,728 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-01-09 22:35:53,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-01-09 22:35:54,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:54,101 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 25 treesize of output 21 [2025-01-09 22:35:54,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-01-09 22:35:54,263 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 6 not checked. [2025-01-09 22:35:54,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:35:54,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:35:54,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-01-09 22:35:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525894405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:35:54,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 22:35:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 41 [2025-01-09 22:35:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398150972] [2025-01-09 22:35:54,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 22:35:54,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-01-09 22:35:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:35:54,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-01-09 22:35:54,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2319, Unknown=1, NotChecked=96, Total=2550 [2025-01-09 22:35:54,912 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 35 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:35:56,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:35:56,202 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2025-01-09 22:35:56,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 22:35:56,203 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 35 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 53 [2025-01-09 22:35:56,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:35:56,203 INFO L225 Difference]: With dead ends: 131 [2025-01-09 22:35:56,203 INFO L226 Difference]: Without dead ends: 131 [2025-01-09 22:35:56,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=257, Invalid=4302, Unknown=1, NotChecked=132, Total=4692 [2025-01-09 22:35:56,204 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 22:35:56,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 628 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1255 Invalid, 0 Unknown, 79 Unchecked, 0.6s Time] [2025-01-09 22:35:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-01-09 22:35:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-01-09 22:35:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 118 states have (on average 1.194915254237288) internal successors, (141), 124 states have internal predecessors, (141), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:35:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 151 transitions. [2025-01-09 22:35:56,209 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 151 transitions. Word has length 53 [2025-01-09 22:35:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:35:56,209 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 151 transitions. [2025-01-09 22:35:56,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.951219512195122) internal successors, (80), 35 states have internal predecessors, (80), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 22:35:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 151 transitions. [2025-01-09 22:35:56,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 22:35:56,214 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:35:56,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:35:56,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-01-09 22:35:56,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-01-09 22:35:56,414 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2025-01-09 22:35:56,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:35:56,415 INFO L85 PathProgramCache]: Analyzing trace with hash 816819881, now seen corresponding path program 2 times [2025-01-09 22:35:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:35:56,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534836951] [2025-01-09 22:35:56,415 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:35:56,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:35:56,421 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 53 statements into 2 equivalence classes. [2025-01-09 22:35:56,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 22:35:56,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:35:56,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat