./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/shared_mem1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/shared_mem1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:05:21,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:05:22,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:05:22,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:05:22,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:05:22,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:05:22,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:05:22,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:05:22,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:05:22,071 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:05:22,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:05:22,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:05:22,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:05:22,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:05:22,072 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:05:22,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:05:22,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:05:22,072 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:05:22,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:05:22,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:05:22,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:05:22,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:05:22,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:05:22,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:05:22,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:05:22,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:05:22,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:05:22,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:05:22,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:05:22,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:05:22,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:22,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:05:22,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:05:22,075 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 47cb7cab177485da5df0f1af4a3f61fd7eb970990493dd3ac764f888774cbf0f [2025-02-07 20:05:22,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:05:22,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:05:22,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:05:22,296 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:05:22,296 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:05:22,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/shared_mem1.i [2025-02-07 20:05:23,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12d9bb6cc/dfddc82b7ba74eba8ddca026fe423b52/FLAGcb1a1d646 [2025-02-07 20:05:23,729 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:05:23,734 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i [2025-02-07 20:05:23,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12d9bb6cc/dfddc82b7ba74eba8ddca026fe423b52/FLAGcb1a1d646 [2025-02-07 20:05:24,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/12d9bb6cc/dfddc82b7ba74eba8ddca026fe423b52 [2025-02-07 20:05:24,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:05:24,044 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:05:24,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:24,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:05:24,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:05:24,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f1974df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24, skipping insertion in model container [2025-02-07 20:05:24,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:05:24,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2025-02-07 20:05:24,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:24,346 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:05:24,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/heap-data/shared_mem1.i[23879,23892] [2025-02-07 20:05:24,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:05:24,392 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:05:24,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24 WrapperNode [2025-02-07 20:05:24,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:05:24,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:24,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:05:24,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:05:24,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,419 INFO L138 Inliner]: procedures = 121, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 73 [2025-02-07 20:05:24,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:05:24,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:05:24,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:05:24,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:05:24,426 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,429 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,440 INFO L175 MemorySlicer]: Split 23 memory accesses to 2 slices as follows [2, 21]. 91 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-02-07 20:05:24,443 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,448 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,451 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,454 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:05:24,454 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:05:24,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:05:24,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:05:24,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (1/1) ... [2025-02-07 20:05:24,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:05:24,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:24,485 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-07 20:05:24,490 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-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 20:05:24,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:05:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 20:05:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:05:24,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:05:24,604 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:05:24,606 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:05:24,751 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-07 20:05:24,752 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:05:24,759 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:05:24,760 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:05:24,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:24 BoogieIcfgContainer [2025-02-07 20:05:24,760 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:05:24,762 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:05:24,762 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:05:24,765 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:05:24,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:05:24" (1/3) ... [2025-02-07 20:05:24,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230f4217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:24, skipping insertion in model container [2025-02-07 20:05:24,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:05:24" (2/3) ... [2025-02-07 20:05:24,766 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230f4217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:05:24, skipping insertion in model container [2025-02-07 20:05:24,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:05:24" (3/3) ... [2025-02-07 20:05:24,767 INFO L128 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2025-02-07 20:05:24,777 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:05:24,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG shared_mem1.i that has 1 procedures, 15 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 20:05:24,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:05:24,824 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=LoopHeads, 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;@3beb91f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:05:24,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:05:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:05:24,831 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:24,831 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:24,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:24,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1830351514, now seen corresponding path program 1 times [2025-02-07 20:05:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182275402] [2025-02-07 20:05:24,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:24,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:24,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:05:24,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:05:24,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:24,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:24,961 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-07 20:05:24,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:24,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182275402] [2025-02-07 20:05:24,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182275402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:24,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:24,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:05:24,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114108676] [2025-02-07 20:05:24,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:24,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:05:24,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:24,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:05:24,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:05:24,993 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 14 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:25,007 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2025-02-07 20:05:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:05:25,009 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 20:05:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:25,013 INFO L225 Difference]: With dead ends: 25 [2025-02-07 20:05:25,013 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 20:05:25,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:05:25,019 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:25,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:25,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 20:05:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 20:05:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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-07 20:05:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-02-07 20:05:25,044 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 9 [2025-02-07 20:05:25,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:25,044 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-07 20:05:25,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:05:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-02-07 20:05:25,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:05:25,046 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:25,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:25,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:05:25,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:25,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:25,047 INFO L85 PathProgramCache]: Analyzing trace with hash -581160460, now seen corresponding path program 1 times [2025-02-07 20:05:25,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:25,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909301793] [2025-02-07 20:05:25,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:25,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:25,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:05:25,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:05:25,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:25,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:25,650 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-07 20:05:25,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:25,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909301793] [2025-02-07 20:05:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909301793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:25,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:25,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-07 20:05:25,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094400305] [2025-02-07 20:05:25,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:25,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:05:25,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:25,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:05:25,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:05:25,652 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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-07 20:05:25,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:25,775 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-02-07 20:05:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:05:25,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2025-02-07 20:05:25,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:25,777 INFO L225 Difference]: With dead ends: 30 [2025-02-07 20:05:25,777 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 20:05:25,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:05:25,778 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:25,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 53 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 20:05:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2025-02-07 20:05:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 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-07 20:05:25,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-02-07 20:05:25,784 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 10 [2025-02-07 20:05:25,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:25,784 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-02-07 20:05:25,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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-07 20:05:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2025-02-07 20:05:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:05:25,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:25,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:25,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:05:25,786 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:25,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:25,786 INFO L85 PathProgramCache]: Analyzing trace with hash -581159499, now seen corresponding path program 1 times [2025-02-07 20:05:25,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:25,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369335940] [2025-02-07 20:05:25,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:25,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:25,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:05:25,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:05:25,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:25,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:26,090 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-07 20:05:26,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:26,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369335940] [2025-02-07 20:05:26,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369335940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:26,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:26,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:05:26,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591264350] [2025-02-07 20:05:26,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:26,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:05:26,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:26,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:05:26,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:26,091 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 20:05:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:26,168 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2025-02-07 20:05:26,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:05:26,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-02-07 20:05:26,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:26,169 INFO L225 Difference]: With dead ends: 35 [2025-02-07 20:05:26,169 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 20:05:26,169 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:05:26,169 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:26,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 38 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:05:26,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 20:05:26,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-02-07 20:05:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 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-07 20:05:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-02-07 20:05:26,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 10 [2025-02-07 20:05:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:26,172 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-02-07 20:05:26,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 20:05:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-02-07 20:05:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-07 20:05:26,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:26,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:26,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:05:26,172 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:26,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash -580235978, now seen corresponding path program 1 times [2025-02-07 20:05:26,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:26,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817734886] [2025-02-07 20:05:26,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:26,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:26,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-07 20:05:26,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-07 20:05:26,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:26,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:26,339 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-07 20:05:26,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:26,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817734886] [2025-02-07 20:05:26,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817734886] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:05:26,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:05:26,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:05:26,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325364385] [2025-02-07 20:05:26,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:05:26,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 20:05:26,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:26,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 20:05:26,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:05:26,340 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 20:05:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:05:26,389 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-02-07 20:05:26,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 20:05:26,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 10 [2025-02-07 20:05:26,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:05:26,390 INFO L225 Difference]: With dead ends: 38 [2025-02-07 20:05:26,390 INFO L226 Difference]: Without dead ends: 31 [2025-02-07 20:05:26,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:05:26,390 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:05:26,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:05:26,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-07 20:05:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2025-02-07 20:05:26,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 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-07 20:05:26,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-02-07 20:05:26,393 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 10 [2025-02-07 20:05:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:05:26,393 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-02-07 20:05:26,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-07 20:05:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-02-07 20:05:26,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:05:26,394 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:05:26,394 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:05:26,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:05:26,394 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:05:26,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:05:26,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1623435638, now seen corresponding path program 1 times [2025-02-07 20:05:26,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:05:26,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494560205] [2025-02-07 20:05:26,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:26,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:05:26,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:05:26,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:05:26,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:26,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:26,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:05:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494560205] [2025-02-07 20:05:26,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494560205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:05:26,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112152955] [2025-02-07 20:05:26,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:05:26,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:05:26,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:05:26,887 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-07 20:05:26,887 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-07 20:05:26,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:05:26,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:05:26,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:05:26,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:05:26,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-07 20:05:26,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:05:27,030 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-07 20:05:27,031 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 19 treesize of output 18 [2025-02-07 20:05:27,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 7 [2025-02-07 20:05:27,078 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 14 treesize of output 15 [2025-02-07 20:05:27,095 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 14 treesize of output 15 [2025-02-07 20:05:27,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2025-02-07 20:05:27,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2025-02-07 20:05:27,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2025-02-07 20:05:27,427 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-07 20:05:27,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2025-02-07 20:05:27,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,452 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-02-07 20:05:27,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2025-02-07 20:05:27,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,476 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-02-07 20:05:27,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2025-02-07 20:05:27,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:05:27,487 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 22 treesize of output 11 [2025-02-07 20:05:27,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:05:27,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 102 [2025-02-07 20:05:27,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 64 [2025-02-07 20:05:27,940 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 0 case distinctions, treesize of input 43 treesize of output 23 [2025-02-07 20:05:28,012 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 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-07 20:05:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:28,016 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:05:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:05:41,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112152955] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:05:41,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:05:41,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-02-07 20:05:41,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829474672] [2025-02-07 20:05:41,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:05:41,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 20:05:41,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:05:41,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 20:05:41,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=156, Unknown=3, NotChecked=0, Total=210 [2025-02-07 20:05:41,815 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-07 20:05:45,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:05:49,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-07 20:06:03,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:06:07,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:06:11,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-07 20:06:15,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:06:19,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-07 20:06:24,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-07 20:06:28,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:06:32,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:06:36,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:06:40,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:06:45,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:06:49,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-07 20:06:54,905 WARN L851 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~list~0#1.base| Int)) (let ((.cse0 (select (select |c_#memory_int#1| |ULTIMATE.start_main_~list~0#1.base|) 0))) (and (not (= |c_ULTIMATE.start_main_~m~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (<= (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) (+ 100 .cse0)) (<= .cse0 1)))) (forall ((|v_ULTIMATE.start_main_#t~mem12#1_10| Int) (|v_ULTIMATE.start_main_#t~mem11#1_10| Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (let ((.cse1 (select |c_#memory_int#1| .cse3)) (.cse2 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|) .cse4))) (or (< (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |v_ULTIMATE.start_main_#t~mem12#1_10|) (< (select .cse1 .cse2) |v_ULTIMATE.start_main_#t~mem11#1_10|) (< (select (select (store |c_#memory_int#1| .cse3 (store .cse1 .cse2 (+ |v_ULTIMATE.start_main_#t~mem11#1_10| |v_ULTIMATE.start_main_#t~mem12#1_10|))) |c_ULTIMATE.start_main_~m~0#1.base|) |c_ULTIMATE.start_main_~m~0#1.offset|) 110))))))) is different from false [2025-02-07 20:06:55,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:06:55,875 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2025-02-07 20:06:55,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 20:06:55,876 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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 14 [2025-02-07 20:06:55,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:06:55,877 INFO L225 Difference]: With dead ends: 67 [2025-02-07 20:06:55,878 INFO L226 Difference]: Without dead ends: 65 [2025-02-07 20:06:55,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=147, Invalid=403, Unknown=6, NotChecked=44, Total=600 [2025-02-07 20:06:55,879 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 78 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 21 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 57.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 59.8s IncrementalHoareTripleChecker+Time [2025-02-07 20:06:55,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 82 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 137 Invalid, 14 Unknown, 12 Unchecked, 59.8s Time] [2025-02-07 20:06:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-07 20:06:55,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 32. [2025-02-07 20:06:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:06:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2025-02-07 20:06:55,888 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 14 [2025-02-07 20:06:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:06:55,889 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2025-02-07 20:06:55,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 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-07 20:06:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2025-02-07 20:06:55,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:06:55,889 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:06:55,889 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:06:55,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-07 20:06:56,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:56,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:06:56,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:06:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1623436599, now seen corresponding path program 1 times [2025-02-07 20:06:56,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:06:56,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017101276] [2025-02-07 20:06:56,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:56,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:06:56,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:06:56,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:06:56,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:56,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:57,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:06:57,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:06:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017101276] [2025-02-07 20:06:57,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017101276] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:06:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929842837] [2025-02-07 20:06:57,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:06:57,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:06:57,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:06:57,161 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-07 20:06:57,162 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-07 20:06:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:06:57,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:06:57,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:06:57,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:06:57,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-07 20:06:57,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:06:57,298 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 14 treesize of output 15 [2025-02-07 20:06:57,554 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-07 20:06:57,555 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 19 treesize of output 18 [2025-02-07 20:06:57,625 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 18 treesize of output 7 [2025-02-07 20:06:57,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 15 [2025-02-07 20:06:58,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 32 [2025-02-07 20:06:58,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:58,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-02-07 20:06:58,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:58,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:58,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 43 [2025-02-07 20:06:58,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:58,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2025-02-07 20:06:58,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:58,563 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 22 treesize of output 11 [2025-02-07 20:06:58,672 INFO L349 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2025-02-07 20:06:58,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 20 [2025-02-07 20:06:58,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:58,880 INFO L349 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2025-02-07 20:06:58,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 25 [2025-02-07 20:06:58,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 20:06:58,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2025-02-07 20:06:59,115 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 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-07 20:07:01,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:01,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 107 [2025-02-07 20:07:01,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 20:07:01,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 81 [2025-02-07 20:07:01,397 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 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-07 20:07:02,135 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 0 case distinctions, treesize of input 22 treesize of output 10 [2025-02-07 20:07:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:07:02,151 INFO L312 TraceCheckSpWp]: Computing backward predicates...