./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-tiling/mbpr3.c --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/array-tiling/mbpr3.c -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 a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 16:57:40,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 16:57:40,546 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 16:57:40,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 16:57:40,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 16:57:40,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 16:57:40,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 16:57:40,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 16:57:40,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 16:57:40,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 16:57:40,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 16:57:40,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 16:57:40,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 16:57:40,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 16:57:40,569 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 16:57:40,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 16:57:40,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 16:57:40,569 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 16:57:40,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 16:57:40,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 16:57:40,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 16:57:40,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 16:57:40,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 16:57:40,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 16:57:40,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 16:57:40,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 16:57:40,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 16:57:40,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 16:57:40,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 16:57:40,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 16:57:40,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 16:57:40,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 16:57:40,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:57:40,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 16:57:40,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 16:57:40,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 16:57:40,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 16:57:40,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 16:57:40,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 16:57:40,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 16:57:40,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 16:57:40,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 16:57:40,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 16:57:40,572 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 -> a50e57e46342104030586dde3ea26bc2e3984490f4fdef34fa383d24842d8980 [2025-02-07 16:57:40,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 16:57:40,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 16:57:40,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 16:57:40,801 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 16:57:40,802 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 16:57:40,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mbpr3.c [2025-02-07 16:57:41,948 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c80ca33ea/b49b629072e24377adaf51df42c60397/FLAG83435ed2f [2025-02-07 16:57:42,143 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 16:57:42,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-tiling/mbpr3.c [2025-02-07 16:57:42,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c80ca33ea/b49b629072e24377adaf51df42c60397/FLAG83435ed2f [2025-02-07 16:57:42,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c80ca33ea/b49b629072e24377adaf51df42c60397 [2025-02-07 16:57:42,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 16:57:42,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 16:57:42,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 16:57:42,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 16:57:42,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 16:57:42,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e11d94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42, skipping insertion in model container [2025-02-07 16:57:42,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 16:57:42,622 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/array-tiling/mbpr3.c[396,409] [2025-02-07 16:57:42,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:57:42,657 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 16:57:42,666 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/array-tiling/mbpr3.c[396,409] [2025-02-07 16:57:42,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 16:57:42,693 INFO L204 MainTranslator]: Completed translation [2025-02-07 16:57:42,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42 WrapperNode [2025-02-07 16:57:42,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 16:57:42,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 16:57:42,695 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 16:57:42,695 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 16:57:42,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,708 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,725 INFO L138 Inliner]: procedures = 15, calls = 40, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2025-02-07 16:57:42,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 16:57:42,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 16:57:42,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 16:57:42,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 16:57:42,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,735 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,748 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [2, 8, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 12 writes are split as follows [0, 0, 12]. [2025-02-07 16:57:42,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,756 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,761 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 16:57:42,763 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 16:57:42,763 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 16:57:42,763 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 16:57:42,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (1/1) ... [2025-02-07 16:57:42,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 16:57:42,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:42,794 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 16:57:42,798 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 16:57:42,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 16:57:42,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 16:57:42,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 16:57:42,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 16:57:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 16:57:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 16:57:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 16:57:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 16:57:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 16:57:42,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 16:57:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 16:57:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 16:57:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 16:57:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 16:57:42,872 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 16:57:42,876 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 16:57:43,033 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-07 16:57:43,033 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 16:57:43,039 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 16:57:43,040 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 16:57:43,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:57:43 BoogieIcfgContainer [2025-02-07 16:57:43,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 16:57:43,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 16:57:43,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 16:57:43,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 16:57:43,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 04:57:42" (1/3) ... [2025-02-07 16:57:43,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74626a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:57:43, skipping insertion in model container [2025-02-07 16:57:43,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 04:57:42" (2/3) ... [2025-02-07 16:57:43,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74626a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 04:57:43, skipping insertion in model container [2025-02-07 16:57:43,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 04:57:43" (3/3) ... [2025-02-07 16:57:43,049 INFO L128 eAbstractionObserver]: Analyzing ICFG mbpr3.c [2025-02-07 16:57:43,061 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 16:57:43,063 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mbpr3.c that has 1 procedures, 25 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-07 16:57:43,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 16:57:43,102 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;@b827a75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 16:57:43,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 16:57:43,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 16:57:43,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:43,110 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:43,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:43,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:43,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1564623801, now seen corresponding path program 1 times [2025-02-07 16:57:43,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:43,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366109386] [2025-02-07 16:57:43,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:43,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:43,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 16:57:43,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 16:57:43,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:43,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:43,274 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 16:57:43,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:43,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366109386] [2025-02-07 16:57:43,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366109386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:57:43,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:57:43,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 16:57:43,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785608511] [2025-02-07 16:57:43,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:57:43,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 16:57:43,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:43,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 16:57:43,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 16:57:43,296 INFO L87 Difference]: Start difference. First operand has 25 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 24 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 16:57:43,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:43,307 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2025-02-07 16:57:43,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 16:57:43,308 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2025-02-07 16:57:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:43,312 INFO L225 Difference]: With dead ends: 45 [2025-02-07 16:57:43,313 INFO L226 Difference]: Without dead ends: 21 [2025-02-07 16:57:43,315 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 16:57:43,317 INFO L435 NwaCegarLoop]: 33 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, 33 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 16:57:43,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:57:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-07 16:57:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-02-07 16:57:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:43,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2025-02-07 16:57:43,341 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 28 transitions. Word has length 13 [2025-02-07 16:57:43,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:43,341 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 28 transitions. [2025-02-07 16:57:43,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 16:57:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2025-02-07 16:57:43,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-07 16:57:43,342 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:43,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:43,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 16:57:43,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:43,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:43,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1368110296, now seen corresponding path program 1 times [2025-02-07 16:57:43,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641893946] [2025-02-07 16:57:43,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:43,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-07 16:57:43,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-07 16:57:43,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:43,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:43,645 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 16:57:43,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641893946] [2025-02-07 16:57:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641893946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:57:43,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:57:43,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 16:57:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657205629] [2025-02-07 16:57:43,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:57:43,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 16:57:43,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:43,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 16:57:43,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:57:43,652 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 16:57:43,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:43,727 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2025-02-07 16:57:43,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 16:57:43,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2025-02-07 16:57:43,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:43,728 INFO L225 Difference]: With dead ends: 43 [2025-02-07 16:57:43,728 INFO L226 Difference]: Without dead ends: 30 [2025-02-07 16:57:43,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 16:57:43,729 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:43,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 17 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:57:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-07 16:57:43,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2025-02-07 16:57:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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 16:57:43,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-02-07 16:57:43,734 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2025-02-07 16:57:43,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:43,734 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-02-07 16:57:43,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 16:57:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-02-07 16:57:43,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 16:57:43,734 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:43,734 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-07 16:57:43,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 16:57:43,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:43,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:43,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1886560433, now seen corresponding path program 1 times [2025-02-07 16:57:43,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:43,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235875060] [2025-02-07 16:57:43,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:43,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 16:57:43,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 16:57:43,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:43,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:43,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:57:43,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:43,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235875060] [2025-02-07 16:57:43,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235875060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:57:43,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:57:43,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 16:57:43,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300942897] [2025-02-07 16:57:43,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:57:43,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 16:57:43,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:43,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 16:57:43,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 16:57:43,869 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:43,883 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-02-07 16:57:43,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 16:57:43,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 16:57:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:43,884 INFO L225 Difference]: With dead ends: 34 [2025-02-07 16:57:43,884 INFO L226 Difference]: Without dead ends: 24 [2025-02-07 16:57:43,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-07 16:57:43,884 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:43,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 21 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:57:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-07 16:57:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-07 16:57:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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 16:57:43,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-02-07 16:57:43,896 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 22 [2025-02-07 16:57:43,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:43,896 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-02-07 16:57:43,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-02-07 16:57:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 16:57:43,897 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:43,897 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-07 16:57:43,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 16:57:43,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:43,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash -665596528, now seen corresponding path program 1 times [2025-02-07 16:57:43,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:43,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302411784] [2025-02-07 16:57:43,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:43,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:43,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 16:57:43,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 16:57:43,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:43,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:44,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 16:57:44,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:44,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302411784] [2025-02-07 16:57:44,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302411784] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:44,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536568800] [2025-02-07 16:57:44,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:44,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:44,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:44,849 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 16:57:44,850 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 16:57:44,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 16:57:44,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 16:57:44,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:44,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:44,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 16:57:44,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:45,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:57:45,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:57:45,116 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-07 16:57:45,137 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 41 treesize of output 11 [2025-02-07 16:57:45,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:57:45,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:45,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 28 [2025-02-07 16:57:45,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:45,267 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 22 treesize of output 10 [2025-02-07 16:57:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:57:45,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:45,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:57:45,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-02-07 16:57:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:57:45,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536568800] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:45,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:45,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 7] total 20 [2025-02-07 16:57:45,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038919582] [2025-02-07 16:57:45,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:45,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-07 16:57:45,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:45,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-07 16:57:45,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-02-07 16:57:45,489 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:45,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:45,755 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2025-02-07 16:57:45,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 16:57:45,755 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 16:57:45,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:45,756 INFO L225 Difference]: With dead ends: 65 [2025-02-07 16:57:45,756 INFO L226 Difference]: Without dead ends: 47 [2025-02-07 16:57:45,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=608, Unknown=0, NotChecked=0, Total=812 [2025-02-07 16:57:45,757 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 162 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:45,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 71 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:57:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-07 16:57:45,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2025-02-07 16:57:45,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 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 16:57:45,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-02-07 16:57:45,762 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 22 [2025-02-07 16:57:45,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:45,762 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-02-07 16:57:45,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-02-07 16:57:45,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 16:57:45,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:45,763 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-07 16:57:45,773 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-07 16:57:45,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:45,967 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:45,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash -665566737, now seen corresponding path program 1 times [2025-02-07 16:57:45,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:45,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407456412] [2025-02-07 16:57:45,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:45,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:45,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-07 16:57:45,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 16:57:45,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:45,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-07 16:57:46,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:46,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407456412] [2025-02-07 16:57:46,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407456412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 16:57:46,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 16:57:46,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 16:57:46,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173027593] [2025-02-07 16:57:46,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 16:57:46,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 16:57:46,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:46,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 16:57:46,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 16:57:46,024 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:46,039 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-02-07 16:57:46,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 16:57:46,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 16:57:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:46,040 INFO L225 Difference]: With dead ends: 30 [2025-02-07 16:57:46,040 INFO L226 Difference]: Without dead ends: 28 [2025-02-07 16:57:46,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 16:57:46,040 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 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-07 16:57:46,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 16:57:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-02-07 16:57:46,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-02-07 16:57:46,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 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 16:57:46,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-02-07 16:57:46,044 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2025-02-07 16:57:46,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:46,044 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-02-07 16:57:46,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-02-07 16:57:46,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 16:57:46,044 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:46,044 INFO L218 NwaCegarLoop]: trace histogram [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-07 16:57:46,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 16:57:46,045 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:46,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash -250622372, now seen corresponding path program 1 times [2025-02-07 16:57:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:46,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089260716] [2025-02-07 16:57:46,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:46,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:46,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 16:57:46,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 16:57:46,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:46,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:57:46,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089260716] [2025-02-07 16:57:46,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089260716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:46,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329597299] [2025-02-07 16:57:46,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 16:57:46,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:46,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:46,549 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 16:57:46,551 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 16:57:46,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 16:57:46,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 16:57:46,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:57:46,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:46,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-07 16:57:46,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:46,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:57:46,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:57:46,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:57:46,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:46,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 28 [2025-02-07 16:57:46,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:46,873 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 22 treesize of output 10 [2025-02-07 16:57:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 16:57:46,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:46,987 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 19 treesize of output 17 [2025-02-07 16:57:46,992 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 24 treesize of output 20 [2025-02-07 16:57:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:57:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329597299] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:47,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:47,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 21 [2025-02-07 16:57:47,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310419399] [2025-02-07 16:57:47,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:47,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 16:57:47,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:47,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 16:57:47,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-02-07 16:57:47,042 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 21 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:47,298 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2025-02-07 16:57:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 16:57:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 21 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-07 16:57:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:47,299 INFO L225 Difference]: With dead ends: 60 [2025-02-07 16:57:47,299 INFO L226 Difference]: Without dead ends: 42 [2025-02-07 16:57:47,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-02-07 16:57:47,300 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 147 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:47,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 68 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 16:57:47,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-07 16:57:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2025-02-07 16:57:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 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 16:57:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2025-02-07 16:57:47,304 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 27 [2025-02-07 16:57:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:47,304 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2025-02-07 16:57:47,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.4285714285714284) internal successors, (72), 21 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:47,304 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2025-02-07 16:57:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-07 16:57:47,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:47,305 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:47,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 16:57:47,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:47,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:47,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1240493328, now seen corresponding path program 2 times [2025-02-07 16:57:47,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:47,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89957749] [2025-02-07 16:57:47,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:57:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:47,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-07 16:57:47,528 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 16:57:47,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:57:47,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:47,989 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 16:57:47,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:47,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89957749] [2025-02-07 16:57:47,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89957749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:47,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532419747] [2025-02-07 16:57:47,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:57:47,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:47,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:47,993 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-07 16:57:47,994 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-07 16:57:48,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-07 16:57:48,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-07 16:57:48,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:57:48,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:48,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 16:57:48,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:48,087 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-07 16:57:48,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:48,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 25 [2025-02-07 16:57:48,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:57:48,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:48,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:57:48,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 16:57:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 16:57:48,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532419747] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:48,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:48,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 31 [2025-02-07 16:57:48,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826512510] [2025-02-07 16:57:48,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:48,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-07 16:57:48,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:48,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-07 16:57:48,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=775, Unknown=0, NotChecked=0, Total=930 [2025-02-07 16:57:48,415 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 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 16:57:49,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:49,162 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2025-02-07 16:57:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-07 16:57:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-07 16:57:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:49,163 INFO L225 Difference]: With dead ends: 106 [2025-02-07 16:57:49,163 INFO L226 Difference]: Without dead ends: 58 [2025-02-07 16:57:49,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=648, Invalid=2774, Unknown=0, NotChecked=0, Total=3422 [2025-02-07 16:57:49,165 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 239 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:49,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 83 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 16:57:49,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-07 16:57:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2025-02-07 16:57:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 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 16:57:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-02-07 16:57:49,170 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 32 [2025-02-07 16:57:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:49,171 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-02-07 16:57:49,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.870967741935484) internal successors, (89), 31 states have internal predecessors, (89), 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 16:57:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-02-07 16:57:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-07 16:57:49,171 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:49,172 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:49,180 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-07 16:57:49,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:49,376 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:49,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:49,376 INFO L85 PathProgramCache]: Analyzing trace with hash -330842797, now seen corresponding path program 3 times [2025-02-07 16:57:49,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:49,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317224936] [2025-02-07 16:57:49,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:57:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:49,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-02-07 16:57:49,419 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 16:57:49,419 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 16:57:49,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:57:50,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:50,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317224936] [2025-02-07 16:57:50,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317224936] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:50,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598056100] [2025-02-07 16:57:50,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:57:50,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:50,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:50,809 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-07 16:57:50,810 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-07 16:57:50,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 46 statements into 4 equivalence classes. [2025-02-07 16:57:50,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-02-07 16:57:50,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 16:57:50,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:50,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-07 16:57:50,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:51,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:57:51,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:57:51,107 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-07 16:57:51,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:57:51,138 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-07 16:57:51,144 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 41 treesize of output 11 [2025-02-07 16:57:51,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:57:51,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:51,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 35 [2025-02-07 16:57:51,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:51,224 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 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 16:57:51,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:51,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 38 [2025-02-07 16:57:51,488 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:51,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-02-07 16:57:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:57:51,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:51,831 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 19 treesize of output 17 [2025-02-07 16:57:51,833 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 24 treesize of output 20 [2025-02-07 16:57:51,896 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 16:57:51,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598056100] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:51,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:51,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 12] total 38 [2025-02-07 16:57:51,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200358775] [2025-02-07 16:57:51,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:51,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-07 16:57:51,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:51,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-07 16:57:51,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2025-02-07 16:57:51,899 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 38 states, 38 states have (on average 3.3157894736842106) internal successors, (126), 38 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:53,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:53,174 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2025-02-07 16:57:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-07 16:57:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.3157894736842106) internal successors, (126), 38 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-07 16:57:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:53,176 INFO L225 Difference]: With dead ends: 115 [2025-02-07 16:57:53,176 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 16:57:53,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=783, Invalid=4047, Unknown=0, NotChecked=0, Total=4830 [2025-02-07 16:57:53,183 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 269 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:53,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 143 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 16:57:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 16:57:53,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 52. [2025-02-07 16:57:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-02-07 16:57:53,193 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 46 [2025-02-07 16:57:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:53,194 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-02-07 16:57:53,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.3157894736842106) internal successors, (126), 38 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:53,194 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-02-07 16:57:53,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-07 16:57:53,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:53,195 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:53,203 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-07 16:57:53,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-07 16:57:53,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:53,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:53,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2147106937, now seen corresponding path program 4 times [2025-02-07 16:57:53,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:53,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166787365] [2025-02-07 16:57:53,402 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 16:57:53,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:53,419 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-02-07 16:57:53,460 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 16:57:53,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 16:57:53,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 9 proven. 47 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 16:57:54,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166787365] [2025-02-07 16:57:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166787365] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969757227] [2025-02-07 16:57:54,218 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 16:57:54,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:54,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:54,224 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-07 16:57:54,226 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-07 16:57:54,270 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 51 statements into 2 equivalence classes. [2025-02-07 16:57:54,293 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 51 of 51 statements. [2025-02-07 16:57:54,293 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 16:57:54,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:54,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-07 16:57:54,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:54,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:57:54,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:57:54,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:57:54,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:54,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 35 [2025-02-07 16:57:54,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:54,542 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 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 16:57:54,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:54,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 38 [2025-02-07 16:57:54,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:54,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2025-02-07 16:57:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 16:57:54,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:55,143 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 19 treesize of output 17 [2025-02-07 16:57:55,145 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 24 treesize of output 20 [2025-02-07 16:57:55,227 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 16:57:55,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969757227] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:55,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:55,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 12] total 41 [2025-02-07 16:57:55,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137565182] [2025-02-07 16:57:55,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:55,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-07 16:57:55,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:55,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-07 16:57:55,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1475, Unknown=0, NotChecked=0, Total=1640 [2025-02-07 16:57:55,229 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:57,476 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2025-02-07 16:57:57,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-02-07 16:57:57,476 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2025-02-07 16:57:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:57,478 INFO L225 Difference]: With dead ends: 156 [2025-02-07 16:57:57,478 INFO L226 Difference]: Without dead ends: 127 [2025-02-07 16:57:57,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2530 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1460, Invalid=8242, Unknown=0, NotChecked=0, Total=9702 [2025-02-07 16:57:57,480 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 328 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:57,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 317 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 16:57:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-07 16:57:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 77. [2025-02-07 16:57:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.118421052631579) internal successors, (85), 76 states have internal predecessors, (85), 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 16:57:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2025-02-07 16:57:57,495 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 51 [2025-02-07 16:57:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:57,495 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2025-02-07 16:57:57,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:57:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2025-02-07 16:57:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-07 16:57:57,496 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:57,496 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:57,512 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-07 16:57:57,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:57,697 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:57,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash 926532883, now seen corresponding path program 5 times [2025-02-07 16:57:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:57,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365534572] [2025-02-07 16:57:57,697 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 16:57:57,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:57,708 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-02-07 16:57:57,720 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 16:57:57,720 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-07 16:57:57,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-07 16:57:58,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365534572] [2025-02-07 16:57:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365534572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762021015] [2025-02-07 16:57:58,166 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 16:57:58,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:58,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:58,168 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-07 16:57:58,170 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-07 16:57:58,214 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 56 statements into 6 equivalence classes. [2025-02-07 16:57:58,326 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 56 of 56 statements. [2025-02-07 16:57:58,327 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-02-07 16:57:58,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:58,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-07 16:57:58,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:57:58,407 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-07 16:57:58,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:57:58,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 25 [2025-02-07 16:57:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 16:57:58,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:57:58,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2025-02-07 16:57:58,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 16:57:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 16:57:58,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762021015] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:57:58,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:57:58,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 13] total 27 [2025-02-07 16:57:58,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958296084] [2025-02-07 16:57:58,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:57:58,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-07 16:57:58,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:57:58,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-07 16:57:58,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-02-07 16:57:58,723 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 27 states have internal predecessors, (110), 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 16:57:59,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:57:59,358 INFO L93 Difference]: Finished difference Result 113 states and 128 transitions. [2025-02-07 16:57:59,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 16:57:59,359 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 27 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-02-07 16:57:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:57:59,359 INFO L225 Difference]: With dead ends: 113 [2025-02-07 16:57:59,360 INFO L226 Difference]: Without dead ends: 111 [2025-02-07 16:57:59,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2025-02-07 16:57:59,360 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 49 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-07 16:57:59,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 205 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-07 16:57:59,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-07 16:57:59,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 82. [2025-02-07 16:57:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.123456790123457) internal successors, (91), 81 states have internal predecessors, (91), 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 16:57:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2025-02-07 16:57:59,369 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 56 [2025-02-07 16:57:59,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:57:59,369 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2025-02-07 16:57:59,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.074074074074074) internal successors, (110), 27 states have internal predecessors, (110), 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 16:57:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2025-02-07 16:57:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 16:57:59,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:57:59,370 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:57:59,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-07 16:57:59,571 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,SelfDestructingSolverStorable9 [2025-02-07 16:57:59,571 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:57:59,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:57:59,571 INFO L85 PathProgramCache]: Analyzing trace with hash -510484040, now seen corresponding path program 6 times [2025-02-07 16:57:59,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:57:59,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514676540] [2025-02-07 16:57:59,572 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 16:57:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:57:59,581 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 7 equivalence classes. [2025-02-07 16:57:59,594 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 16:57:59,594 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-07 16:57:59,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:57:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 73 proven. 31 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 16:57:59,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:57:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514676540] [2025-02-07 16:57:59,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514676540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:57:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537788474] [2025-02-07 16:57:59,828 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 16:57:59,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:57:59,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:57:59,830 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-07 16:57:59,831 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-07 16:57:59,879 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 61 statements into 7 equivalence classes. [2025-02-07 16:58:00,068 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 16:58:00,068 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-02-07 16:58:00,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:00,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-07 16:58:00,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 99 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 16:58:00,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 99 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 16:58:00,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537788474] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:00,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:00,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 39 [2025-02-07 16:58:00,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008530673] [2025-02-07 16:58:00,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:00,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-02-07 16:58:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:00,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-02-07 16:58:00,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2025-02-07 16:58:00,689 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 39 states, 39 states have (on average 3.948717948717949) internal successors, (154), 39 states have internal predecessors, (154), 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 16:58:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:00,974 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2025-02-07 16:58:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 16:58:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.948717948717949) internal successors, (154), 39 states have internal predecessors, (154), 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 61 [2025-02-07 16:58:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:00,976 INFO L225 Difference]: With dead ends: 168 [2025-02-07 16:58:00,976 INFO L226 Difference]: Without dead ends: 77 [2025-02-07 16:58:00,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=498, Invalid=1482, Unknown=0, NotChecked=0, Total=1980 [2025-02-07 16:58:00,977 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 190 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:00,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 188 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 16:58:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-02-07 16:58:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2025-02-07 16:58:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:00,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2025-02-07 16:58:00,983 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 61 [2025-02-07 16:58:00,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:00,984 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2025-02-07 16:58:00,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.948717948717949) internal successors, (154), 39 states have internal predecessors, (154), 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 16:58:00,984 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2025-02-07 16:58:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 16:58:00,984 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:00,984 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:00,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-07 16:58:01,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:01,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:01,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1306725776, now seen corresponding path program 7 times [2025-02-07 16:58:01,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:01,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436421966] [2025-02-07 16:58:01,186 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 16:58:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:01,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 16:58:01,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 16:58:01,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:01,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:02,248 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 12 proven. 111 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 16:58:02,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:02,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436421966] [2025-02-07 16:58:02,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436421966] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:02,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717952949] [2025-02-07 16:58:02,249 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 16:58:02,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:02,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:02,251 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-07 16:58:02,252 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-07 16:58:02,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 16:58:02,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 16:58:02,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 16:58:02,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:02,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-02-07 16:58:02,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:02,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:58:02,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:58:02,575 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-07 16:58:02,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:58:02,622 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-07 16:58:02,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:58:02,646 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-07 16:58:02,656 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 41 treesize of output 11 [2025-02-07 16:58:02,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:58:02,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:02,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 35 [2025-02-07 16:58:02,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:02,759 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 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 16:58:02,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:02,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 45 [2025-02-07 16:58:02,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:02,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-07 16:58:02,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:02,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 48 [2025-02-07 16:58:03,403 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:03,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 16 [2025-02-07 16:58:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 12 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:03,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:08,036 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 19 treesize of output 17 [2025-02-07 16:58:08,041 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 24 treesize of output 20 [2025-02-07 16:58:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 12 proven. 110 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 16:58:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717952949] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:08,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 23, 17] total 52 [2025-02-07 16:58:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722358977] [2025-02-07 16:58:08,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:08,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-07 16:58:08,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:08,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-07 16:58:08,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=2416, Unknown=0, NotChecked=0, Total=2652 [2025-02-07 16:58:08,190 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 52 states, 52 states have (on average 3.6153846153846154) internal successors, (188), 52 states have internal predecessors, (188), 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 16:58:10,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:10,768 INFO L93 Difference]: Finished difference Result 148 states and 170 transitions. [2025-02-07 16:58:10,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-07 16:58:10,768 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.6153846153846154) internal successors, (188), 52 states have internal predecessors, (188), 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 70 [2025-02-07 16:58:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:10,769 INFO L225 Difference]: With dead ends: 148 [2025-02-07 16:58:10,769 INFO L226 Difference]: Without dead ends: 139 [2025-02-07 16:58:10,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 111 SyntacticMatches, 7 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2562 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1066, Invalid=8246, Unknown=0, NotChecked=0, Total=9312 [2025-02-07 16:58:10,771 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 647 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 2342 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 2521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 2342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:10,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 473 Invalid, 2521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 2342 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 16:58:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-02-07 16:58:10,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2025-02-07 16:58:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 16:58:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2025-02-07 16:58:10,779 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 70 [2025-02-07 16:58:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:10,779 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2025-02-07 16:58:10,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.6153846153846154) internal successors, (188), 52 states have internal predecessors, (188), 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 16:58:10,780 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2025-02-07 16:58:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 16:58:10,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:10,780 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:10,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 16:58:10,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:10,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:10,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:10,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1181043332, now seen corresponding path program 8 times [2025-02-07 16:58:10,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:10,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418284663] [2025-02-07 16:58:10,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:10,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:10,998 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-07 16:58:11,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 16:58:11,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:11,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 15 proven. 142 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 16:58:11,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418284663] [2025-02-07 16:58:11,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418284663] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185944219] [2025-02-07 16:58:11,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 16:58:11,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:11,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:11,838 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-07 16:58:11,839 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-07 16:58:11,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-07 16:58:11,931 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 16:58:11,931 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 16:58:11,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:11,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-07 16:58:11,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:12,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:58:12,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:58:12,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:58:12,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:12,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 35 [2025-02-07 16:58:12,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:12,276 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 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 16:58:12,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:12,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 45 [2025-02-07 16:58:12,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:12,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-07 16:58:12,413 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:12,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 48 [2025-02-07 16:58:13,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:13,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 16 [2025-02-07 16:58:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 14 proven. 154 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 16:58:13,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:13,494 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 19 treesize of output 17 [2025-02-07 16:58:13,496 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 24 treesize of output 20 [2025-02-07 16:58:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 14 proven. 131 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 16:58:13,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185944219] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:13,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:13,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 16] total 55 [2025-02-07 16:58:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308718654] [2025-02-07 16:58:13,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:13,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-07 16:58:13,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:13,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-07 16:58:13,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2741, Unknown=0, NotChecked=0, Total=2970 [2025-02-07 16:58:13,642 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 55 states, 55 states have (on average 3.581818181818182) internal successors, (197), 55 states have internal predecessors, (197), 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 16:58:19,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:19,248 INFO L93 Difference]: Finished difference Result 283 states and 315 transitions. [2025-02-07 16:58:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2025-02-07 16:58:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.581818181818182) internal successors, (197), 55 states have internal predecessors, (197), 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 75 [2025-02-07 16:58:19,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:19,249 INFO L225 Difference]: With dead ends: 283 [2025-02-07 16:58:19,249 INFO L226 Difference]: Without dead ends: 239 [2025-02-07 16:58:19,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 117 SyntacticMatches, 7 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7239 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2670, Invalid=22136, Unknown=0, NotChecked=0, Total=24806 [2025-02-07 16:58:19,253 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 449 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 5100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:19,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1195 Invalid, 5100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-07 16:58:19,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-07 16:58:19,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 107. [2025-02-07 16:58:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.0943396226415094) internal successors, (116), 106 states have internal predecessors, (116), 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 16:58:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2025-02-07 16:58:19,265 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 75 [2025-02-07 16:58:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:19,265 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2025-02-07 16:58:19,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.581818181818182) internal successors, (197), 55 states have internal predecessors, (197), 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 16:58:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2025-02-07 16:58:19,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-07 16:58:19,266 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:19,266 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:19,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-07 16:58:19,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:19,467 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:19,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:19,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1380386320, now seen corresponding path program 9 times [2025-02-07 16:58:19,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:19,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837585902] [2025-02-07 16:58:19,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:58:19,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:19,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 9 equivalence classes. [2025-02-07 16:58:19,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 16:58:19,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 16:58:19,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 105 proven. 86 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-07 16:58:20,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837585902] [2025-02-07 16:58:20,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837585902] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:20,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432129334] [2025-02-07 16:58:20,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 16:58:20,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:20,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:20,207 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-07 16:58:20,208 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-07 16:58:20,287 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 9 equivalence classes. [2025-02-07 16:58:20,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 80 of 80 statements. [2025-02-07 16:58:20,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-02-07 16:58:20,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:20,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-07 16:58:20,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:21,126 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 16 treesize of output 12 [2025-02-07 16:58:21,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:21,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 55 treesize of output 40 [2025-02-07 16:58:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 7 proven. 184 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-07 16:58:21,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:21,938 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 51 treesize of output 45 [2025-02-07 16:58:21,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2025-02-07 16:58:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-07 16:58:22,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432129334] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:22,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:22,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 55 [2025-02-07 16:58:22,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966976093] [2025-02-07 16:58:22,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:22,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-07 16:58:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:22,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-07 16:58:22,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2737, Unknown=0, NotChecked=0, Total=2970 [2025-02-07 16:58:22,196 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 55 states, 55 states have (on average 3.4363636363636365) internal successors, (189), 55 states have internal predecessors, (189), 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 16:58:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 16:58:27,773 INFO L93 Difference]: Finished difference Result 368 states and 404 transitions. [2025-02-07 16:58:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2025-02-07 16:58:27,773 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.4363636363636365) internal successors, (189), 55 states have internal predecessors, (189), 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 80 [2025-02-07 16:58:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 16:58:27,774 INFO L225 Difference]: With dead ends: 368 [2025-02-07 16:58:27,774 INFO L226 Difference]: Without dead ends: 222 [2025-02-07 16:58:27,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12773 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=3642, Invalid=33800, Unknown=0, NotChecked=0, Total=37442 [2025-02-07 16:58:27,779 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1027 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3284 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 3661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 3284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-07 16:58:27,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 475 Invalid, 3661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 3284 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-07 16:58:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-07 16:58:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 150. [2025-02-07 16:58:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 1.1073825503355705) internal successors, (165), 149 states have internal predecessors, (165), 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 16:58:27,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 165 transitions. [2025-02-07 16:58:27,815 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 165 transitions. Word has length 80 [2025-02-07 16:58:27,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 16:58:27,815 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 165 transitions. [2025-02-07 16:58:27,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.4363636363636365) internal successors, (189), 55 states have internal predecessors, (189), 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 16:58:27,815 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 165 transitions. [2025-02-07 16:58:27,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-07 16:58:27,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 16:58:27,816 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 16:58:27,824 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-07 16:58:28,022 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,SelfDestructingSolverStorable13 [2025-02-07 16:58:28,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 16:58:28,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 16:58:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1705804915, now seen corresponding path program 10 times [2025-02-07 16:58:28,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 16:58:28,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707465057] [2025-02-07 16:58:28,023 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 16:58:28,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 16:58:28,036 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 94 statements into 2 equivalence classes. [2025-02-07 16:58:28,064 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-07 16:58:28,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 16:58:28,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:29,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 16:58:29,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707465057] [2025-02-07 16:58:29,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707465057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 16:58:29,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947306246] [2025-02-07 16:58:29,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 16:58:29,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 16:58:29,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 16:58:29,544 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-07 16:58:29,545 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-07 16:58:29,618 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 94 statements into 2 equivalence classes. [2025-02-07 16:58:29,660 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 94 of 94 statements. [2025-02-07 16:58:29,660 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 16:58:29,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 16:58:29,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-02-07 16:58:29,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 16:58:29,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-07 16:58:29,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:58:29,911 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-07 16:58:29,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:58:29,950 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-07 16:58:29,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:58:29,997 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-07 16:58:30,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 11 [2025-02-07 16:58:30,022 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-07 16:58:30,033 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 41 treesize of output 11 [2025-02-07 16:58:30,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 16:58:30,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:30,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 35 [2025-02-07 16:58:30,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:30,132 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 1 case distinctions, treesize of input 26 treesize of output 28 [2025-02-07 16:58:30,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:30,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 45 [2025-02-07 16:58:30,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:30,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-07 16:58:30,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:30,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 55 [2025-02-07 16:58:30,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:30,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-02-07 16:58:30,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:30,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 58 treesize of output 58 [2025-02-07 16:58:31,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 16:58:31,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 43 treesize of output 19 [2025-02-07 16:58:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 16:58:31,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 16:58:32,512 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 19 treesize of output 17 [2025-02-07 16:58:32,514 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 24 treesize of output 20 [2025-02-07 16:58:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 241 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-07 16:58:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947306246] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 16:58:32,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 16:58:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 30, 22] total 69 [2025-02-07 16:58:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927756759] [2025-02-07 16:58:32,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 16:58:32,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-02-07 16:58:32,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 16:58:32,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-02-07 16:58:32,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=4353, Unknown=0, NotChecked=0, Total=4692 [2025-02-07 16:58:32,715 INFO L87 Difference]: Start difference. First operand 150 states and 165 transitions. Second operand has 69 states, 69 states have (on average 3.8115942028985508) internal successors, (263), 69 states have internal predecessors, (263), 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 16:58:37,240 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 16:58:41,275 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 16:58:45,294 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 16:58:49,333 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 16:58:53,582 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 [1] [2025-02-07 16:58:58,189 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 [1] [2025-02-07 16:59:02,242 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 16:59:06,270 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 [1] [2025-02-07 16:59:10,299 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 16:59:14,315 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]