./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-before.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-shared-before.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 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:34:48,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:34:48,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2025-02-08 06:34:48,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:34:48,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:34:48,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:34:48,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:34:48,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:34:48,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:34:48,619 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:34:48,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:34:48,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:34:48,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:34:48,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:34:48,620 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:34:48,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:34:48,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:34:48,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:34:48,621 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:34:48,622 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:34:48,622 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:34:48,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:34:48,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:34:48,622 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:34:48,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:34:48,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:34:48,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:34:48,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:34:48,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:34:48,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:34:48,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:34:48,623 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:34:48,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:34:48,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:34:48,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:34:48,624 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:34:48,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:34:48,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:34:48,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:34:48,624 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 -> 332869ec37f6f5fc1ff0b6d6275b635675d9112e392919be0a978cd693d61f8f [2025-02-08 06:34:48,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:34:48,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:34:48,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:34:48,924 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:34:48,924 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:34:48,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2025-02-08 06:34:50,259 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02f1b5007/6f5f31577723432baa3c89e0a4dac1d4/FLAG1a8b8ad96 [2025-02-08 06:34:50,587 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:34:50,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-before.i [2025-02-08 06:34:50,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02f1b5007/6f5f31577723432baa3c89e0a4dac1d4/FLAG1a8b8ad96 [2025-02-08 06:34:50,849 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02f1b5007/6f5f31577723432baa3c89e0a4dac1d4 [2025-02-08 06:34:50,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:34:50,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:34:50,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:34:50,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:34:50,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:34:50,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:34:50" (1/1) ... [2025-02-08 06:34:50,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5b0aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:50, skipping insertion in model container [2025-02-08 06:34:50,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:34:50" (1/1) ... [2025-02-08 06:34:50,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:34:51,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:34:51,115 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:34:51,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:34:51,184 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:34:51,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51 WrapperNode [2025-02-08 06:34:51,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:34:51,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:34:51,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:34:51,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:34:51,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,227 INFO L138 Inliner]: procedures = 120, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2025-02-08 06:34:51,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:34:51,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:34:51,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:34:51,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:34:51,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,254 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 5 writes are split as follows [5]. [2025-02-08 06:34:51,254 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,265 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:34:51,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:34:51,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:34:51,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:34:51,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (1/1) ... [2025-02-08 06:34:51,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:34:51,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:34:51,301 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:34:51,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:34:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:34:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2025-02-08 06:34:51,326 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2025-02-08 06:34:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:34:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:34:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:34:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:34:51,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:34:51,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:34:51,412 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:34:51,414 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:34:51,623 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-02-08 06:34:51,623 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:34:51,634 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:34:51,635 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:34:51,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:34:51 BoogieIcfgContainer [2025-02-08 06:34:51,635 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:34:51,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:34:51,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:34:51,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:34:51,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:34:50" (1/3) ... [2025-02-08 06:34:51,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f00c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:34:51, skipping insertion in model container [2025-02-08 06:34:51,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:34:51" (2/3) ... [2025-02-08 06:34:51,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f00c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:34:51, skipping insertion in model container [2025-02-08 06:34:51,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:34:51" (3/3) ... [2025-02-08 06:34:51,645 INFO L128 eAbstractionObserver]: Analyzing ICFG sll-shared-before.i [2025-02-08 06:34:51,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:34:51,655 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll-shared-before.i that has 2 procedures, 57 locations, 1 initial locations, 2 loop locations, and 23 error locations. [2025-02-08 06:34:51,689 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:34:51,702 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;@72609f57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:34:51,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 06:34:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:34:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:34:51,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:51,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:34:51,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:51,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2751, now seen corresponding path program 1 times [2025-02-08 06:34:51,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:51,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996818388] [2025-02-08 06:34:51,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:51,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:51,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:34:51,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:34:51,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:51,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:51,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:51,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996818388] [2025-02-08 06:34:51,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996818388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:51,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:51,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:34:51,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608170545] [2025-02-08 06:34:51,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:51,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:34:51,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:51,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:34:51,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:51,933 INFO L87 Difference]: Start difference. First operand has 57 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 53 states have internal predecessors, (56), 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 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:34:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:52,000 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2025-02-08 06:34:52,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:34:52,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 06:34:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:52,006 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:34:52,007 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 06:34:52,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:52,011 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:52,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 84 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:34:52,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 06:34:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 06:34:52,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.793103448275862) internal successors, (52), 50 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:34:52,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2025-02-08 06:34:52,041 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 2 [2025-02-08 06:34:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:52,041 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2025-02-08 06:34:52,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:34:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2025-02-08 06:34:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:34:52,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:52,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:34:52,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:34:52,042 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2752, now seen corresponding path program 1 times [2025-02-08 06:34:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461821981] [2025-02-08 06:34:52,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:52,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:34:52,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:34:52,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:52,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:52,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:52,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461821981] [2025-02-08 06:34:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461821981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:52,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:52,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:34:52,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610287386] [2025-02-08 06:34:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:52,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:34:52,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:52,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:34:52,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:52,132 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:34:52,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:52,185 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2025-02-08 06:34:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:34:52,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 06:34:52,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:52,186 INFO L225 Difference]: With dead ends: 53 [2025-02-08 06:34:52,186 INFO L226 Difference]: Without dead ends: 53 [2025-02-08 06:34:52,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:52,187 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 2 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:52,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 82 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:34:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-02-08 06:34:52,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-02-08 06:34:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 49 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:34:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2025-02-08 06:34:52,195 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 2 [2025-02-08 06:34:52,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:52,195 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2025-02-08 06:34:52,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:34:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2025-02-08 06:34:52,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:34:52,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:52,196 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:34:52,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:34:52,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:52,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1753677628, now seen corresponding path program 1 times [2025-02-08 06:34:52,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:52,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10699867] [2025-02-08 06:34:52,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:52,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:52,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:34:52,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:34:52,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:52,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:52,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:52,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10699867] [2025-02-08 06:34:52,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10699867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:52,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:34:52,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211430029] [2025-02-08 06:34:52,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:52,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:34:52,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:52,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:34:52,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:52,302 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:34:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:52,358 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2025-02-08 06:34:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:34:52,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:34:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:52,359 INFO L225 Difference]: With dead ends: 52 [2025-02-08 06:34:52,359 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 06:34:52,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:52,360 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:52,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:34:52,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 06:34:52,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-08 06:34:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 48 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-02-08 06:34:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2025-02-08 06:34:52,366 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 6 [2025-02-08 06:34:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:52,366 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2025-02-08 06:34:52,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:34:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2025-02-08 06:34:52,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:34:52,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:52,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:34:52,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:34:52,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:52,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:52,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1753677627, now seen corresponding path program 1 times [2025-02-08 06:34:52,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:52,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636822851] [2025-02-08 06:34:52,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:52,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:52,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:34:52,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:34:52,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:52,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:52,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:52,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636822851] [2025-02-08 06:34:52,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636822851] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:52,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:52,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:34:52,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450734347] [2025-02-08 06:34:52,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:52,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:34:52,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:52,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:34:52,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:52,488 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:34:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:52,524 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2025-02-08 06:34:52,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:34:52,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:34:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:52,526 INFO L225 Difference]: With dead ends: 51 [2025-02-08 06:34:52,526 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:34:52,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:52,527 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:52,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 87 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:34:52,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:34:52,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-08 06:34:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 47 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-02-08 06:34:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-02-08 06:34:52,537 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 6 [2025-02-08 06:34:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:52,538 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-02-08 06:34:52,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:34:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-02-08 06:34:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:34:52,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:52,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:52,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:34:52,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:52,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash 2028679731, now seen corresponding path program 1 times [2025-02-08 06:34:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:52,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997193400] [2025-02-08 06:34:52,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:52,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:34:52,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:34:52,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:52,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997193400] [2025-02-08 06:34:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997193400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:52,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:34:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515795425] [2025-02-08 06:34:52,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:52,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:34:52,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:52,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:34:52,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:34:52,669 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-02-08 06:34:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:52,786 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2025-02-08 06:34:52,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:34:52,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2025-02-08 06:34:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:52,790 INFO L225 Difference]: With dead ends: 52 [2025-02-08 06:34:52,790 INFO L226 Difference]: Without dead ends: 52 [2025-02-08 06:34:52,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:34:52,791 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:52,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 125 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:34:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-08 06:34:52,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2025-02-08 06:34:52,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 44 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-02-08 06:34:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-02-08 06:34:52,798 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 11 [2025-02-08 06:34:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:52,798 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-02-08 06:34:52,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-02-08 06:34:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-02-08 06:34:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:34:52,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:52,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:52,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:34:52,799 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:52,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2028679732, now seen corresponding path program 1 times [2025-02-08 06:34:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:52,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789998135] [2025-02-08 06:34:52,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:52,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:52,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:34:52,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:34:52,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:52,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:53,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:53,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789998135] [2025-02-08 06:34:53,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789998135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:53,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:53,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:34:53,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209279974] [2025-02-08 06:34:53,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:53,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:34:53,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:53,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:34:53,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:34:53,007 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-02-08 06:34:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:53,092 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2025-02-08 06:34:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:34:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 11 [2025-02-08 06:34:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:53,093 INFO L225 Difference]: With dead ends: 51 [2025-02-08 06:34:53,093 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:34:53,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:34:53,093 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:53,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 198 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:34:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:34:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2025-02-08 06:34:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 43 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:34:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2025-02-08 06:34:53,097 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 11 [2025-02-08 06:34:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:53,098 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2025-02-08 06:34:53,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-02-08 06:34:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2025-02-08 06:34:53,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:34:53,098 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:53,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:53,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:34:53,099 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:53,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:53,099 INFO L85 PathProgramCache]: Analyzing trace with hash -824711600, now seen corresponding path program 1 times [2025-02-08 06:34:53,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493439261] [2025-02-08 06:34:53,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:53,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:34:53,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:34:53,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:53,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:53,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493439261] [2025-02-08 06:34:53,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493439261] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:53,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:34:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096958249] [2025-02-08 06:34:53,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:53,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:34:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:53,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:34:53,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:53,165 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-02-08 06:34:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:53,176 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2025-02-08 06:34:53,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:34:53,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02-08 06:34:53,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:53,177 INFO L225 Difference]: With dead ends: 46 [2025-02-08 06:34:53,177 INFO L226 Difference]: Without dead ends: 46 [2025-02-08 06:34:53,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:53,178 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:53,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 68 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:34:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-02-08 06:34:53,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-02-08 06:34:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 42 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:34:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2025-02-08 06:34:53,185 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 15 [2025-02-08 06:34:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:53,185 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2025-02-08 06:34:53,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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-02-08 06:34:53,186 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2025-02-08 06:34:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:34:53,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:53,187 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:53,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:34:53,187 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:53,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:53,188 INFO L85 PathProgramCache]: Analyzing trace with hash 203744168, now seen corresponding path program 1 times [2025-02-08 06:34:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563984742] [2025-02-08 06:34:53,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:53,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:34:53,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:34:53,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:53,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:53,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:53,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:53,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563984742] [2025-02-08 06:34:53,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563984742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:53,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:53,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:34:53,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943952574] [2025-02-08 06:34:53,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:53,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:34:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:53,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:34:53,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:53,237 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 06:34:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:53,255 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2025-02-08 06:34:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:34:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2025-02-08 06:34:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:53,257 INFO L225 Difference]: With dead ends: 45 [2025-02-08 06:34:53,257 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 06:34:53,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:34:53,257 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 15 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:53,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 56 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:34:53,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 06:34:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 06:34:53,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 41 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:34:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-02-08 06:34:53,262 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 16 [2025-02-08 06:34:53,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:53,262 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-02-08 06:34:53,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-02-08 06:34:53,262 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-02-08 06:34:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-08 06:34:53,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:53,263 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:53,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:34:53,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:53,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2021101902, now seen corresponding path program 1 times [2025-02-08 06:34:53,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:53,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477403546] [2025-02-08 06:34:53,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:53,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:53,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 06:34:53,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 06:34:53,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:53,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:53,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:53,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477403546] [2025-02-08 06:34:53,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477403546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:53,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:34:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749695419] [2025-02-08 06:34:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:53,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:34:53,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:53,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:34:53,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:34:53,424 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-02-08 06:34:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:53,506 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2025-02-08 06:34:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:34:53,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-02-08 06:34:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:53,507 INFO L225 Difference]: With dead ends: 44 [2025-02-08 06:34:53,507 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 06:34:53,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:34:53,508 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 14 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:53,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:34:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 06:34:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-02-08 06:34:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 40 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-02-08 06:34:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2025-02-08 06:34:53,514 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 17 [2025-02-08 06:34:53,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:53,514 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2025-02-08 06:34:53,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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-02-08 06:34:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2025-02-08 06:34:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:34:53,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:53,517 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:53,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:34:53,517 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:53,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash -204852359, now seen corresponding path program 1 times [2025-02-08 06:34:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:53,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428273676] [2025-02-08 06:34:53,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:53,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:53,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:34:53,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:34:53,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:53,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:53,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428273676] [2025-02-08 06:34:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428273676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:34:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787098701] [2025-02-08 06:34:53,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:53,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:34:53,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:34:53,762 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:34:53,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:34:53,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:34:53,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:34:53,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:53,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:53,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 06:34:53,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:34:53,912 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2025-02-08 06:34:53,973 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:34:53,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:34:53,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:53,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:34:53,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787098701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:53,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:34:53,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2025-02-08 06:34:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763551252] [2025-02-08 06:34:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:53,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:34:53,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:53,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:34:53,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-02-08 06:34:53,983 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:34:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:54,034 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-02-08 06:34:54,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:34:54,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2025-02-08 06:34:54,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:54,035 INFO L225 Difference]: With dead ends: 49 [2025-02-08 06:34:54,036 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 06:34:54,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2025-02-08 06:34:54,036 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:54,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 70 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 63 Unchecked, 0.0s Time] [2025-02-08 06:34:54,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 06:34:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2025-02-08 06:34:54,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.46875) internal successors, (47), 43 states have internal predecessors, (47), 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-02-08 06:34:54,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2025-02-08 06:34:54,041 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 20 [2025-02-08 06:34:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:54,042 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2025-02-08 06:34:54,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:34:54,042 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2025-02-08 06:34:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:34:54,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:54,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:54,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 06:34:54,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 06:34:54,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:54,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash -204852358, now seen corresponding path program 1 times [2025-02-08 06:34:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:54,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247734905] [2025-02-08 06:34:54,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:54,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:34:54,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:34:54,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:54,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:54,550 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247734905] [2025-02-08 06:34:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247734905] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:34:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926857167] [2025-02-08 06:34:54,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:54,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:34:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:34:54,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:34:54,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:34:54,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:34:54,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:34:54,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:54,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:54,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:34:54,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:34:54,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:34:54,842 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-02-08 06:34:54,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:34:54,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:34:54,885 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:34:54,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:34:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-08 06:34:54,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:34:55,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926857167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:34:55,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:34:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2025-02-08 06:34:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981795422] [2025-02-08 06:34:55,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:34:55,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-08 06:34:55,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:55,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-08 06:34:55,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:34:55,037 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 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-02-08 06:34:55,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:55,254 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-02-08 06:34:55,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:34:55,254 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 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 20 [2025-02-08 06:34:55,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:55,256 INFO L225 Difference]: With dead ends: 56 [2025-02-08 06:34:55,256 INFO L226 Difference]: Without dead ends: 56 [2025-02-08 06:34:55,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=322, Unknown=1, NotChecked=36, Total=420 [2025-02-08 06:34:55,257 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:55,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 225 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 179 Invalid, 0 Unknown, 56 Unchecked, 0.1s Time] [2025-02-08 06:34:55,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-02-08 06:34:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2025-02-08 06:34:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 48 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-02-08 06:34:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-02-08 06:34:55,263 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 20 [2025-02-08 06:34:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:55,263 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-02-08 06:34:55,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 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-02-08 06:34:55,264 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-02-08 06:34:55,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:34:55,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:55,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:55,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:34:55,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:34:55,469 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:55,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:55,469 INFO L85 PathProgramCache]: Analyzing trace with hash 953709675, now seen corresponding path program 1 times [2025-02-08 06:34:55,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:55,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468051040] [2025-02-08 06:34:55,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:55,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:55,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:34:55,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:34:55,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:55,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:55,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:55,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468051040] [2025-02-08 06:34:55,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468051040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:55,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:55,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:34:55,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391223022] [2025-02-08 06:34:55,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:55,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:34:55,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:55,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:34:55,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:34:55,700 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-02-08 06:34:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:55,864 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2025-02-08 06:34:55,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:34:55,865 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 19 [2025-02-08 06:34:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:55,867 INFO L225 Difference]: With dead ends: 58 [2025-02-08 06:34:55,867 INFO L226 Difference]: Without dead ends: 58 [2025-02-08 06:34:55,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:34:55,868 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:55,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 142 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:34:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-08 06:34:55,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-08 06:34:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 53 states have internal predecessors, (60), 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-02-08 06:34:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-02-08 06:34:55,873 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 19 [2025-02-08 06:34:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:55,873 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-02-08 06:34:55,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-02-08 06:34:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2025-02-08 06:34:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:34:55,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:55,875 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:55,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:34:55,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:55,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:55,876 INFO L85 PathProgramCache]: Analyzing trace with hash 953709676, now seen corresponding path program 1 times [2025-02-08 06:34:55,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:55,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255578678] [2025-02-08 06:34:55,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:55,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:55,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:34:55,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:34:55,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:55,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:56,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:56,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255578678] [2025-02-08 06:34:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255578678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:56,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:56,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:34:56,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961792658] [2025-02-08 06:34:56,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:56,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:34:56,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:56,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:34:56,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:34:56,107 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-02-08 06:34:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:56,217 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2025-02-08 06:34:56,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:34:56,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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 19 [2025-02-08 06:34:56,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:56,218 INFO L225 Difference]: With dead ends: 60 [2025-02-08 06:34:56,218 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 06:34:56,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:34:56,219 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:56,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 161 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:34:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 06:34:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-08 06:34:56,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 55 states have internal predecessors, (61), 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-02-08 06:34:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2025-02-08 06:34:56,228 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 19 [2025-02-08 06:34:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:56,228 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2025-02-08 06:34:56,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-02-08 06:34:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2025-02-08 06:34:56,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-08 06:34:56,229 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:56,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:56,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:34:56,230 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:56,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash 953709324, now seen corresponding path program 1 times [2025-02-08 06:34:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945574231] [2025-02-08 06:34:56,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:56,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 06:34:56,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 06:34:56,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:56,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:56,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:56,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945574231] [2025-02-08 06:34:56,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945574231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:56,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:56,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:34:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840588998] [2025-02-08 06:34:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:56,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:34:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:56,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:34:56,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:34:56,310 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-02-08 06:34:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:56,364 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2025-02-08 06:34:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:34:56,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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 19 [2025-02-08 06:34:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:56,365 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:34:56,365 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 06:34:56,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:34:56,366 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:56,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 222 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:34:56,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 06:34:56,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2025-02-08 06:34:56,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.326086956521739) internal successors, (61), 56 states have internal predecessors, (61), 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-02-08 06:34:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-02-08 06:34:56,372 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 19 [2025-02-08 06:34:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:56,373 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-02-08 06:34:56,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 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-02-08 06:34:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2025-02-08 06:34:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:34:56,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:56,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:56,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:34:56,373 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:56,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:56,374 INFO L85 PathProgramCache]: Analyzing trace with hash 391908492, now seen corresponding path program 1 times [2025-02-08 06:34:56,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:56,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116048678] [2025-02-08 06:34:56,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:56,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:56,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:34:56,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:34:56,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:34:56,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:56,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116048678] [2025-02-08 06:34:56,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116048678] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:56,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:56,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:34:56,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828521738] [2025-02-08 06:34:56,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:56,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:34:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:56,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:34:56,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:34:56,485 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:34:56,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:56,564 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2025-02-08 06:34:56,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:34:56,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 06:34:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:56,565 INFO L225 Difference]: With dead ends: 60 [2025-02-08 06:34:56,565 INFO L226 Difference]: Without dead ends: 60 [2025-02-08 06:34:56,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:34:56,567 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 4 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:56,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 141 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:34:56,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-08 06:34:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-08 06:34:56,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 55 states have internal predecessors, (59), 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-02-08 06:34:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2025-02-08 06:34:56,570 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 23 [2025-02-08 06:34:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:56,570 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2025-02-08 06:34:56,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:34:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2025-02-08 06:34:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:34:56,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:56,571 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:56,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:34:56,572 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:56,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:56,572 INFO L85 PathProgramCache]: Analyzing trace with hash 391908493, now seen corresponding path program 1 times [2025-02-08 06:34:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:56,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10929441] [2025-02-08 06:34:56,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:56,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:56,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:34:56,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:34:56,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:56,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:34:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10929441] [2025-02-08 06:34:56,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10929441] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:56,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:56,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:34:56,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933630614] [2025-02-08 06:34:56,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:56,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:34:56,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:56,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:34:56,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:34:56,807 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:34:56,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:56,878 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2025-02-08 06:34:56,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:34:56,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2025-02-08 06:34:56,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:56,880 INFO L225 Difference]: With dead ends: 59 [2025-02-08 06:34:56,880 INFO L226 Difference]: Without dead ends: 59 [2025-02-08 06:34:56,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:34:56,880 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:56,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 152 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:34:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-08 06:34:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-02-08 06:34:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 54 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-02-08 06:34:56,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2025-02-08 06:34:56,885 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 23 [2025-02-08 06:34:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:56,886 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2025-02-08 06:34:56,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:34:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2025-02-08 06:34:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:34:56,888 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:56,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:56,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:34:56,889 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:56,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:56,889 INFO L85 PathProgramCache]: Analyzing trace with hash 756249924, now seen corresponding path program 1 times [2025-02-08 06:34:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:56,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921711051] [2025-02-08 06:34:56,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:56,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:56,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:34:56,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:34:56,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:56,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:56,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:56,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921711051] [2025-02-08 06:34:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921711051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:34:56,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:34:56,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:34:56,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290206341] [2025-02-08 06:34:56,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:34:56,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:34:56,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:56,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:34:56,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:34:56,985 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-02-08 06:34:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:57,059 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2025-02-08 06:34:57,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:34:57,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2025-02-08 06:34:57,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:57,060 INFO L225 Difference]: With dead ends: 64 [2025-02-08 06:34:57,060 INFO L226 Difference]: Without dead ends: 64 [2025-02-08 06:34:57,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:34:57,061 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:57,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 178 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:34:57,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-02-08 06:34:57,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2025-02-08 06:34:57,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.28) internal successors, (64), 58 states have internal predecessors, (64), 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-02-08 06:34:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2025-02-08 06:34:57,064 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 22 [2025-02-08 06:34:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:57,064 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2025-02-08 06:34:57,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-02-08 06:34:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2025-02-08 06:34:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:34:57,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:57,065 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] [2025-02-08 06:34:57,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:34:57,065 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:57,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1956969468, now seen corresponding path program 1 times [2025-02-08 06:34:57,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:57,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249870831] [2025-02-08 06:34:57,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:57,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:34:57,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:34:57,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:57,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:57,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:57,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249870831] [2025-02-08 06:34:57,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249870831] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:34:57,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729005076] [2025-02-08 06:34:57,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:57,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:34:57,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:34:57,519 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:34:57,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:34:57,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:34:57,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:34:57,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:57,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:57,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 06:34:57,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:34:57,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:34:57,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:34:57,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:34:57,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 06:34:57,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:34:57,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 06:34:57,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:34:57,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-02-08 06:34:57,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:34:57,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-02-08 06:34:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:57,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:34:58,484 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 15 treesize of output 13 [2025-02-08 06:34:58,491 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 90 treesize of output 86 [2025-02-08 06:34:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:58,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729005076] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:34:58,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:34:58,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2025-02-08 06:34:58,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831779526] [2025-02-08 06:34:58,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:34:58,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-08 06:34:58,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:58,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-08 06:34:58,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2025-02-08 06:34:58,508 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 23 states have internal predecessors, (42), 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-02-08 06:34:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:34:58,832 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2025-02-08 06:34:58,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:34:58,833 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 23 states have internal predecessors, (42), 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 25 [2025-02-08 06:34:58,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:34:58,833 INFO L225 Difference]: With dead ends: 66 [2025-02-08 06:34:58,833 INFO L226 Difference]: Without dead ends: 66 [2025-02-08 06:34:58,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:34:58,834 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 13 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:34:58,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 426 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:34:58,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-08 06:34:58,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-02-08 06:34:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 61 states have internal predecessors, (67), 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-02-08 06:34:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2025-02-08 06:34:58,837 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 25 [2025-02-08 06:34:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:34:58,837 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2025-02-08 06:34:58,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 23 states have internal predecessors, (42), 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-02-08 06:34:58,838 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2025-02-08 06:34:58,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 06:34:58,838 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:34:58,838 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:34:58,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:34:59,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:34:59,040 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:34:59,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:34:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1956969819, now seen corresponding path program 1 times [2025-02-08 06:34:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:34:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247219367] [2025-02-08 06:34:59,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:34:59,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:34:59,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:34:59,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:59,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:34:59,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:34:59,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247219367] [2025-02-08 06:34:59,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247219367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:34:59,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497072069] [2025-02-08 06:34:59,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:34:59,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:34:59,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:34:59,319 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:34:59,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:34:59,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 06:34:59,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 06:34:59,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:34:59,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:34:59,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 06:34:59,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:34:59,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 16 treesize of output 27 [2025-02-08 06:34:59,684 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_destroy_~l#1.base_16| Int) (|v_ULTIMATE.start_main_~data~0#1.base_12| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_12| 1) |v_ULTIMATE.start_destroy_~l#1.base_16|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_12| 0) |v_ULTIMATE.start_destroy_~l#1.base_16| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_12|) 0))) is different from true [2025-02-08 06:34:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-08 06:34:59,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:34:59,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497072069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:34:59,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:34:59,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2025-02-08 06:34:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218314895] [2025-02-08 06:34:59,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:34:59,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:34:59,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:34:59,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:34:59,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=367, Unknown=1, NotChecked=38, Total=462 [2025-02-08 06:34:59,824 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 14 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-02-08 06:35:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:00,005 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-02-08 06:35:00,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:35:00,006 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 14 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) Word has length 25 [2025-02-08 06:35:00,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:00,007 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:35:00,007 INFO L226 Difference]: Without dead ends: 55 [2025-02-08 06:35:00,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=406, Unknown=1, NotChecked=40, Total=506 [2025-02-08 06:35:00,007 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:00,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 176 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 242 Invalid, 0 Unknown, 57 Unchecked, 0.2s Time] [2025-02-08 06:35:00,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-02-08 06:35:00,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-02-08 06:35:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 50 states have internal predecessors, (55), 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-02-08 06:35:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2025-02-08 06:35:00,010 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 25 [2025-02-08 06:35:00,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:00,010 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2025-02-08 06:35:00,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 14 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-02-08 06:35:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2025-02-08 06:35:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:35:00,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:00,011 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:00,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:35:00,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:00,216 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:35:00,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 335094616, now seen corresponding path program 1 times [2025-02-08 06:35:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225440158] [2025-02-08 06:35:00,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:00,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:00,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:00,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:00,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:35:00,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225440158] [2025-02-08 06:35:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225440158] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:00,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137658301] [2025-02-08 06:35:00,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:00,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:00,649 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:00,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:35:00,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:00,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:00,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:00,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:00,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:35:00,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:00,794 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:00,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:35:00,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:35:00,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-02-08 06:35:00,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-02-08 06:35:00,896 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-02-08 06:35:00,920 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:35:00,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 06:35:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2025-02-08 06:35:00,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:01,056 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-02-08 06:35:01,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2025-02-08 06:35:01,098 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_625 (Array Int Int))) (let ((.cse1 (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_625) |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) .cse0)))) is different from false [2025-02-08 06:35:01,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:01,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-08 06:35:01,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-02-08 06:35:01,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 06:35:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137658301] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:01,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:01,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 11, 12] total 27 [2025-02-08 06:35:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798905325] [2025-02-08 06:35:01,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:01,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:35:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:01,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:35:01,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=574, Unknown=9, NotChecked=98, Total=756 [2025-02-08 06:35:01,205 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 23 states have internal predecessors, (57), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 06:35:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:01,523 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2025-02-08 06:35:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:35:01,524 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 23 states have internal predecessors, (57), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 35 [2025-02-08 06:35:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:01,524 INFO L225 Difference]: With dead ends: 54 [2025-02-08 06:35:01,524 INFO L226 Difference]: Without dead ends: 54 [2025-02-08 06:35:01,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=812, Unknown=9, NotChecked=118, Total=1056 [2025-02-08 06:35:01,526 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:01,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 365 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 343 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2025-02-08 06:35:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-08 06:35:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-08 06:35:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 49 states have internal predecessors, (54), 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-02-08 06:35:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2025-02-08 06:35:01,528 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 35 [2025-02-08 06:35:01,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:01,528 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2025-02-08 06:35:01,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 23 states have internal predecessors, (57), 3 states have call successors, (4), 4 states have call predecessors, (4), 7 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-02-08 06:35:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2025-02-08 06:35:01,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:35:01,529 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:01,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:01,537 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-02-08 06:35:01,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:01,730 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:35:01,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:01,730 INFO L85 PathProgramCache]: Analyzing trace with hash 335094617, now seen corresponding path program 1 times [2025-02-08 06:35:01,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:01,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856503630] [2025-02-08 06:35:01,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:01,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:01,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:01,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:01,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:01,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:02,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856503630] [2025-02-08 06:35:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856503630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476668343] [2025-02-08 06:35:02,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:02,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:02,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:02,309 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:02,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:35:02,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:35:02,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:35:02,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:02,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:02,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-08 06:35:02,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:02,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:35:02,512 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:02,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:02,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:35:02,536 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 13 treesize of output 9 [2025-02-08 06:35:02,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:35:02,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2025-02-08 06:35:02,615 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 30 treesize of output 13 [2025-02-08 06:35:02,664 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 42 treesize of output 18 [2025-02-08 06:35:02,670 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 9 treesize of output 3 [2025-02-08 06:35:02,769 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2025-02-08 06:35:02,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:02,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:02,797 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:02,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:02,799 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-02-08 06:35:02,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476668343] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:02,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:02,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 26 [2025-02-08 06:35:02,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336416062] [2025-02-08 06:35:02,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:02,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 06:35:02,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:02,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 06:35:02,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=682, Unknown=1, NotChecked=52, Total=812 [2025-02-08 06:35:02,906 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 27 states, 26 states have (on average 2.0) internal successors, (52), 22 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:03,352 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2025-02-08 06:35:03,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:35:03,353 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 22 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 35 [2025-02-08 06:35:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:03,353 INFO L225 Difference]: With dead ends: 51 [2025-02-08 06:35:03,353 INFO L226 Difference]: Without dead ends: 51 [2025-02-08 06:35:03,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=1178, Unknown=1, NotChecked=70, Total=1406 [2025-02-08 06:35:03,354 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:03,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 444 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 490 Invalid, 0 Unknown, 45 Unchecked, 0.2s Time] [2025-02-08 06:35:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-08 06:35:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2025-02-08 06:35:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 36 states have (on average 1.25) internal successors, (45), 40 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:35:03,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-02-08 06:35:03,356 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 35 [2025-02-08 06:35:03,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:03,357 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-02-08 06:35:03,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.0) internal successors, (52), 22 states have internal predecessors, (52), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:35:03,357 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-02-08 06:35:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:35:03,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:03,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:03,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:35:03,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-02-08 06:35:03,558 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:35:03,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:03,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1663863980, now seen corresponding path program 1 times [2025-02-08 06:35:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:03,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180060836] [2025-02-08 06:35:03,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:03,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:03,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:35:03,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:35:03,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:03,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:03,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180060836] [2025-02-08 06:35:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180060836] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014461833] [2025-02-08 06:35:03,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:03,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:03,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:03,805 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:03,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:35:03,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:35:03,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:35:03,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:03,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:03,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:35:03,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:03,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:03,950 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:03,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:04,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:04,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:04,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:04,068 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 17 treesize of output 21 [2025-02-08 06:35:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:04,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014461833] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:04,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:04,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2025-02-08 06:35:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726505770] [2025-02-08 06:35:04,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:04,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:35:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:04,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:35:04,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:35:04,151 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:35:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:04,423 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2025-02-08 06:35:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:35:04,424 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2025-02-08 06:35:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:04,424 INFO L225 Difference]: With dead ends: 61 [2025-02-08 06:35:04,424 INFO L226 Difference]: Without dead ends: 61 [2025-02-08 06:35:04,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:35:04,426 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 41 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:04,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 149 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-08 06:35:04,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2025-02-08 06:35:04,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 55 states have internal predecessors, (62), 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-02-08 06:35:04,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2025-02-08 06:35:04,429 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 34 [2025-02-08 06:35:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2025-02-08 06:35:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 11 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:35:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2025-02-08 06:35:04,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-08 06:35:04,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:04,430 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:04,438 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-02-08 06:35:04,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:04,634 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:35:04,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:04,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1663863981, now seen corresponding path program 1 times [2025-02-08 06:35:04,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:04,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798694193] [2025-02-08 06:35:04,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:04,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:04,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:35:04,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:35:04,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:04,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798694193] [2025-02-08 06:35:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798694193] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564335103] [2025-02-08 06:35:04,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:04,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:04,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:04,848 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:04,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:35:04,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 06:35:04,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 06:35:04,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:04,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:04,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:35:04,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:05,166 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:05,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:05,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-02-08 06:35:05,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:05,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564335103] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:35:05,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:35:05,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-02-08 06:35:05,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352855737] [2025-02-08 06:35:05,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:05,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:35:05,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:05,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:35:05,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:35:05,396 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 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-02-08 06:35:05,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:05,530 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-02-08 06:35:05,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 06:35:05,531 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 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 34 [2025-02-08 06:35:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:05,531 INFO L225 Difference]: With dead ends: 63 [2025-02-08 06:35:05,531 INFO L226 Difference]: Without dead ends: 63 [2025-02-08 06:35:05,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:35:05,532 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:05,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 298 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:35:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-08 06:35:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2025-02-08 06:35:05,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 53 states have (on average 1.1886792452830188) internal successors, (63), 57 states have internal predecessors, (63), 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-02-08 06:35:05,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2025-02-08 06:35:05,535 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 34 [2025-02-08 06:35:05,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:05,535 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2025-02-08 06:35:05,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.3043478260869565) internal successors, (76), 21 states have internal predecessors, (76), 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-02-08 06:35:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2025-02-08 06:35:05,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:35:05,536 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:05,536 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:05,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:05,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:05,739 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:35:05,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:05,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1431165051, now seen corresponding path program 1 times [2025-02-08 06:35:05,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:05,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389477904] [2025-02-08 06:35:05,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:05,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:05,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:05,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:05,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:05,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:06,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:06,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:06,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389477904] [2025-02-08 06:35:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389477904] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:06,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196138743] [2025-02-08 06:35:06,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:06,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:06,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:06,586 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:06,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:35:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:06,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:06,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:06,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:06,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-02-08 06:35:06,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:06,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:06,774 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:35:06,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:35:06,947 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-02-08 06:35:06,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-02-08 06:35:06,983 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-02-08 06:35:07,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:35:07,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2025-02-08 06:35:07,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:35:07,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:07,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2025-02-08 06:35:07,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-08 06:35:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:35:07,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:07,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:07,526 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 42 treesize of output 46 [2025-02-08 06:35:07,633 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-02-08 06:35:07,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:07,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:07,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196138743] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:07,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:07,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 34 [2025-02-08 06:35:07,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849595853] [2025-02-08 06:35:07,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:07,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 06:35:07,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:07,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 06:35:07,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2025-02-08 06:35:07,730 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:08,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:08,396 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-02-08 06:35:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:35:08,396 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2025-02-08 06:35:08,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:08,397 INFO L225 Difference]: With dead ends: 67 [2025-02-08 06:35:08,397 INFO L226 Difference]: Without dead ends: 67 [2025-02-08 06:35:08,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=196, Invalid=2156, Unknown=0, NotChecked=0, Total=2352 [2025-02-08 06:35:08,398 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:08,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 274 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:35:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-08 06:35:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-02-08 06:35:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 61 states have internal predecessors, (69), 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-02-08 06:35:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-02-08 06:35:08,403 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 40 [2025-02-08 06:35:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:08,403 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-02-08 06:35:08,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 30 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-02-08 06:35:08,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:35:08,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:08,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:08,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:08,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:08,609 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:35:08,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:08,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1431165050, now seen corresponding path program 1 times [2025-02-08 06:35:08,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:08,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163527002] [2025-02-08 06:35:08,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:08,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:08,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:08,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:09,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163527002] [2025-02-08 06:35:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163527002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49839880] [2025-02-08 06:35:09,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:09,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:09,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:09,437 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:09,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:35:09,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:09,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:09,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:09,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:09,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-02-08 06:35:09,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:09,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-08 06:35:09,724 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:09,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:09,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:09,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:09,847 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:35:09,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-02-08 06:35:09,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:35:09,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:09,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2025-02-08 06:35:09,990 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:09,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-02-08 06:35:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:10,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:10,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (and (forall ((v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1099) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 16) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1098) |c_ULTIMATE.start_create_~sll~0#1.base|) 8)))) (forall ((v_ArrVal_1099 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1099) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) 8))))) is different from false [2025-02-08 06:35:10,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:10,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-08 06:35:10,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:10,515 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 36 treesize of output 37 [2025-02-08 06:35:10,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:10,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2025-02-08 06:35:10,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:10,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-02-08 06:35:10,537 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:10,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-02-08 06:35:10,543 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 06:35:10,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-02-08 06:35:10,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49839880] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:10,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:10,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2025-02-08 06:35:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932574031] [2025-02-08 06:35:10,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:10,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-08 06:35:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:10,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-08 06:35:10,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=2070, Unknown=30, NotChecked=92, Total=2352 [2025-02-08 06:35:10,675 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 33 states have internal predecessors, (70), 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-02-08 06:35:11,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:11,366 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2025-02-08 06:35:11,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-08 06:35:11,367 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 33 states have internal predecessors, (70), 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 40 [2025-02-08 06:35:11,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:11,368 INFO L225 Difference]: With dead ends: 69 [2025-02-08 06:35:11,368 INFO L226 Difference]: Without dead ends: 69 [2025-02-08 06:35:11,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=3132, Unknown=33, NotChecked=114, Total=3540 [2025-02-08 06:35:11,369 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:11,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 442 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:35:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-02-08 06:35:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2025-02-08 06:35:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 63 states have internal predecessors, (70), 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-02-08 06:35:11,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2025-02-08 06:35:11,372 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 40 [2025-02-08 06:35:11,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:11,373 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2025-02-08 06:35:11,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 33 states have internal predecessors, (70), 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-02-08 06:35:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2025-02-08 06:35:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:35:11,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:11,374 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:11,382 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-02-08 06:35:11,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 06:35:11,575 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:35:11,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1431165402, now seen corresponding path program 1 times [2025-02-08 06:35:11,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691800482] [2025-02-08 06:35:11,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:11,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:11,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:11,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:11,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:12,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691800482] [2025-02-08 06:35:12,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691800482] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:12,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643491105] [2025-02-08 06:35:12,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:12,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:12,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:12,185 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:12,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:35:12,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:35:12,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:35:12,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:12,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:12,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-08 06:35:12,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:12,466 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:12,467 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-02-08 06:35:12,509 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-02-08 06:35:12,581 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:35:12,581 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-02-08 06:35:12,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:12,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 20 [2025-02-08 06:35:12,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:12,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:12,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:12,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2025-02-08 06:35:12,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:12,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2025-02-08 06:35:12,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-08 06:35:13,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643491105] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:13,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 33 [2025-02-08 06:35:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971248544] [2025-02-08 06:35:13,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:13,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-08 06:35:13,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:13,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 06:35:13,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1346, Unknown=18, NotChecked=0, Total=1482 [2025-02-08 06:35:13,027 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 28 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:13,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:13,497 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2025-02-08 06:35:13,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:35:13,498 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 28 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 40 [2025-02-08 06:35:13,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:13,498 INFO L225 Difference]: With dead ends: 71 [2025-02-08 06:35:13,498 INFO L226 Difference]: Without dead ends: 71 [2025-02-08 06:35:13,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=212, Invalid=2219, Unknown=19, NotChecked=0, Total=2450 [2025-02-08 06:35:13,499 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:13,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 532 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-08 06:35:13,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2025-02-08 06:35:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 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-02-08 06:35:13,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2025-02-08 06:35:13,502 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 40 [2025-02-08 06:35:13,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:13,503 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2025-02-08 06:35:13,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 28 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:13,503 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2025-02-08 06:35:13,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 06:35:13,503 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:13,504 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, 1, 1] [2025-02-08 06:35:13,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 06:35:13,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 06:35:13,708 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:35:13,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash 302298090, now seen corresponding path program 1 times [2025-02-08 06:35:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385529542] [2025-02-08 06:35:13,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:13,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:13,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 06:35:13,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:35:13,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:13,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:14,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:14,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385529542] [2025-02-08 06:35:14,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385529542] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873506637] [2025-02-08 06:35:14,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:35:14,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:14,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:14,321 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:14,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:35:14,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 06:35:14,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:35:14,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:35:14,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:14,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-08 06:35:14,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:14,605 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:14,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:14,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:35:14,730 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:35:14,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-08 06:35:14,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:14,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2025-02-08 06:35:14,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:14,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:15,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1282 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ 8 |c_ULTIMATE.start_create_~now~0#1.offset|)) v_ArrVal_1282) |c_ULTIMATE.start_create_~sll~0#1.base|) 8) |c_#StackHeapBarrier|)) is different from false [2025-02-08 06:35:15,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:15,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-02-08 06:35:15,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:15,117 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 33 [2025-02-08 06:35:15,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2025-02-08 06:35:15,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873506637] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:15,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:35:15,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 32 [2025-02-08 06:35:15,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272280180] [2025-02-08 06:35:15,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:35:15,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-08 06:35:15,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:35:15,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 06:35:15,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1277, Unknown=17, NotChecked=72, Total=1482 [2025-02-08 06:35:15,215 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 28 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:35:15,687 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2025-02-08 06:35:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:35:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 28 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2025-02-08 06:35:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:35:15,688 INFO L225 Difference]: With dead ends: 70 [2025-02-08 06:35:15,688 INFO L226 Difference]: Without dead ends: 70 [2025-02-08 06:35:15,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=2132, Unknown=20, NotChecked=94, Total=2450 [2025-02-08 06:35:15,689 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:35:15,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 406 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:35:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-02-08 06:35:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2025-02-08 06:35:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 63 states have internal predecessors, (69), 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-02-08 06:35:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2025-02-08 06:35:15,692 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 43 [2025-02-08 06:35:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:35:15,692 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2025-02-08 06:35:15,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 28 states have internal predecessors, (63), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:35:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2025-02-08 06:35:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-08 06:35:15,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:35:15,693 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:35:15,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 06:35:15,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:15,897 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 20 more)] === [2025-02-08 06:35:15,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:35:15,897 INFO L85 PathProgramCache]: Analyzing trace with hash -784041058, now seen corresponding path program 2 times [2025-02-08 06:35:15,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:35:15,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111487049] [2025-02-08 06:35:15,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:35:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:35:15,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-08 06:35:15,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:35:15,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:35:15,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:16,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:35:16,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111487049] [2025-02-08 06:35:16,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111487049] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:35:16,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477793802] [2025-02-08 06:35:16,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:35:16,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:35:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:35:16,932 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:35:16,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:35:17,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-08 06:35:17,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 06:35:17,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:35:17,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:35:17,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-02-08 06:35:17,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:35:17,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:35:17,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:17,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:35:17,297 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:35:17,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:35:17,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-08 06:35:17,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-08 06:35:17,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:17,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:35:17,540 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:35:17,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 60 [2025-02-08 06:35:17,554 INFO L349 Elim1Store]: treesize reduction 33, result has 28.3 percent of original size [2025-02-08 06:35:17,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 32 [2025-02-08 06:35:18,121 INFO L349 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2025-02-08 06:35:18,122 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 57 treesize of output 38 [2025-02-08 06:35:18,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:18,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2025-02-08 06:35:18,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:35:18,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:35:18,896 INFO L349 Elim1Store]: treesize reduction 516, result has 36.1 percent of original size [2025-02-08 06:35:18,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1290 treesize of output 1355 [2025-02-08 06:35:19,247 INFO L349 Elim1Store]: treesize reduction 232, result has 46.3 percent of original size [2025-02-08 06:35:19,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 2451 treesize of output 1505 [2025-02-08 06:35:19,790 INFO L349 Elim1Store]: treesize reduction 12, result has 95.3 percent of original size [2025-02-08 06:35:19,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 4143 treesize of output 4175 [2025-02-08 06:35:20,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:20,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3270 treesize of output 3408 [2025-02-08 06:35:39,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:39,104 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 2545 treesize of output 2395 [2025-02-08 06:35:45,135 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:35:45,135 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 2503 treesize of output 2360 [2025-02-08 06:35:45,170 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 2370 treesize of output 2366 [2025-02-08 06:35:49,367 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 267 treesize of output 263 [2025-02-08 06:35:49,854 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 91 treesize of output 87 [2025-02-08 06:35:49,951 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 211 treesize of output 205 [2025-02-08 06:35:50,169 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 91 treesize of output 87 [2025-02-08 06:35:56,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-08 06:35:57,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-08 06:35:57,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-08 06:35:57,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-08 06:35:57,638 WARN L214 Elim1Store]: Array PQE input equivalent to true