./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/indp2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-fpi/indp2.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 22448626353835b24dede83f92858a925e988e04b05430a9ca91763be927cf92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:29:55,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:29:55,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:29:55,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:29:55,756 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:29:55,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:29:55,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:29:55,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:29:55,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:29:55,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:29:55,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:29:55,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:29:55,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:29:55,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:29:55,774 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:29:55,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:29:55,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:29:55,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:29:55,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:29:55,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:29:55,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:29:55,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:29:55,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:29:55,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:29:55,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:29:55,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:29:55,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:29:55,777 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 -> 22448626353835b24dede83f92858a925e988e04b05430a9ca91763be927cf92 [2025-02-05 10:29:55,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:29:55,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:29:55,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:29:55,993 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:29:55,993 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:29:55,994 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/indp2.c [2025-02-05 10:29:57,032 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2f3f2469/ae93e25178f448479ed9d3950728de39/FLAGa9a573539 [2025-02-05 10:29:57,264 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:29:57,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/indp2.c [2025-02-05 10:29:57,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2f3f2469/ae93e25178f448479ed9d3950728de39/FLAGa9a573539 [2025-02-05 10:29:57,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b2f3f2469/ae93e25178f448479ed9d3950728de39 [2025-02-05 10:29:57,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:29:57,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:29:57,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:29:57,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:29:57,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:29:57,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@94883f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57, skipping insertion in model container [2025-02-05 10:29:57,309 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:29:57,416 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-fpi/indp2.c[588,601] [2025-02-05 10:29:57,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:29:57,440 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:29:57,447 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-fpi/indp2.c[588,601] [2025-02-05 10:29:57,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:29:57,467 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:29:57,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57 WrapperNode [2025-02-05 10:29:57,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:29:57,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:29:57,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:29:57,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:29:57,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,478 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,492 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2025-02-05 10:29:57,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:29:57,494 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:29:57,494 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:29:57,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:29:57,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,513 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 8, 6]. 50 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 3 writes are split as follows [0, 0, 3]. [2025-02-05 10:29:57,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,518 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:29:57,527 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:29:57,527 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:29:57,527 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:29:57,528 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (1/1) ... [2025-02-05 10:29:57,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:29:57,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:29:57,555 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-05 10:29:57,562 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-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:29:57,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:29:57,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-05 10:29:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-05 10:29:57,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-05 10:29:57,623 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:29:57,624 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:29:57,755 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-05 10:29:57,755 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:29:57,765 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:29:57,765 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:29:57,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:29:57 BoogieIcfgContainer [2025-02-05 10:29:57,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:29:57,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:29:57,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:29:57,772 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:29:57,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:29:57" (1/3) ... [2025-02-05 10:29:57,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e2c5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:29:57, skipping insertion in model container [2025-02-05 10:29:57,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:29:57" (2/3) ... [2025-02-05 10:29:57,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e2c5f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:29:57, skipping insertion in model container [2025-02-05 10:29:57,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:29:57" (3/3) ... [2025-02-05 10:29:57,775 INFO L128 eAbstractionObserver]: Analyzing ICFG indp2.c [2025-02-05 10:29:57,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:29:57,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG indp2.c that has 1 procedures, 16 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-05 10:29:57,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:29:57,843 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;@72e67741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:29:57,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:29:57,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 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-05 10:29:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:29:57,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:57,850 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:57,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:57,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:57,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1543215825, now seen corresponding path program 1 times [2025-02-05 10:29:57,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:57,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357846046] [2025-02-05 10:29:57,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:57,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:29:57,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:29:57,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:57,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:57,967 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-05 10:29:57,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357846046] [2025-02-05 10:29:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357846046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:29:57,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:29:57,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:29:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280016129] [2025-02-05 10:29:57,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:29:57,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 10:29:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:57,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 10:29:57,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 10:29:57,987 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 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) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-05 10:29:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:57,996 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2025-02-05 10:29:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 10:29:57,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2025-02-05 10:29:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:58,001 INFO L225 Difference]: With dead ends: 28 [2025-02-05 10:29:58,002 INFO L226 Difference]: Without dead ends: 13 [2025-02-05 10:29:58,005 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-05 10:29:58,010 INFO L435 NwaCegarLoop]: 20 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, 20 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-05 10:29:58,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:29:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-05 10:29:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-05 10:29:58,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 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-05 10:29:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2025-02-05 10:29:58,029 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 11 [2025-02-05 10:29:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:58,030 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2025-02-05 10:29:58,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-05 10:29:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2025-02-05 10:29:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-05 10:29:58,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:58,030 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:58,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:29:58,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:58,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1008941136, now seen corresponding path program 1 times [2025-02-05 10:29:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:58,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816043788] [2025-02-05 10:29:58,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:58,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:58,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-05 10:29:58,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-05 10:29:58,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:58,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:58,141 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-05 10:29:58,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816043788] [2025-02-05 10:29:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816043788] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:29:58,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:29:58,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:29:58,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801529953] [2025-02-05 10:29:58,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:29:58,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:29:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:58,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:29:58,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:29:58,145 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-05 10:29:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:58,186 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-02-05 10:29:58,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:29:58,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2025-02-05 10:29:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:58,187 INFO L225 Difference]: With dead ends: 28 [2025-02-05 10:29:58,188 INFO L226 Difference]: Without dead ends: 21 [2025-02-05 10:29:58,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:29:58,188 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:29:58,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:29:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-02-05 10:29:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2025-02-05 10:29:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-05 10:29:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2025-02-05 10:29:58,193 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 11 [2025-02-05 10:29:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:58,193 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2025-02-05 10:29:58,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-05 10:29:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2025-02-05 10:29:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-05 10:29:58,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:58,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:58,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:29:58,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:58,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:58,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1048826634, now seen corresponding path program 1 times [2025-02-05 10:29:58,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:58,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473274269] [2025-02-05 10:29:58,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:58,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:58,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:29:58,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:29:58,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:58,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:29:58,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1615739522] [2025-02-05 10:29:58,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:29:58,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:58,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:29:58,248 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-05 10:29:58,251 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-05 10:29:58,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-05 10:29:58,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-05 10:29:58,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:29:58,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:58,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-05 10:29:58,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:29:58,379 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 9 [2025-02-05 10:29:58,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-02-05 10:29:58,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-05 10:29:58,495 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-05 10:29:58,495 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:29:58,589 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 22 treesize of output 20 [2025-02-05 10:29:58,593 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-05 10:29:58,605 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-05 10:29:58,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:58,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473274269] [2025-02-05 10:29:58,606 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:29:58,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615739522] [2025-02-05 10:29:58,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615739522] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:29:58,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:29:58,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-02-05 10:29:58,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070487390] [2025-02-05 10:29:58,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:29:58,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:29:58,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:58,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:29:58,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:29:58,607 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-05 10:29:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:58,708 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-02-05 10:29:58,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:29:58,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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 14 [2025-02-05 10:29:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:58,708 INFO L225 Difference]: With dead ends: 38 [2025-02-05 10:29:58,709 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 10:29:58,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:29:58,709 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:29:58,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 72 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:29:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 10:29:58,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2025-02-05 10:29:58,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 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-05 10:29:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-02-05 10:29:58,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 14 [2025-02-05 10:29:58,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:58,714 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-02-05 10:29:58,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 13 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-05 10:29:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-02-05 10:29:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-05 10:29:58,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:58,714 INFO L218 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:58,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:29:58,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:58,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:58,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:58,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1425487926, now seen corresponding path program 2 times [2025-02-05 10:29:58,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:58,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098978005] [2025-02-05 10:29:58,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:29:58,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:58,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-05 10:29:58,939 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:29:58,940 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:29:58,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:59,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 10:29:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098978005] [2025-02-05 10:29:59,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098978005] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:29:59,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239282412] [2025-02-05 10:29:59,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:29:59,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:59,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:29:59,092 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-05 10:29:59,092 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-05 10:29:59,123 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-05 10:29:59,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-05 10:29:59,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:29:59,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:59,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 10:29:59,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:29:59,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:29:59,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:29:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 10:29:59,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239282412] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:29:59,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:29:59,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2025-02-05 10:29:59,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064295246] [2025-02-05 10:29:59,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:29:59,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 10:29:59,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:59,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 10:29:59,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:29:59,222 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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-05 10:29:59,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:59,299 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2025-02-05 10:29:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:29:59,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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 16 [2025-02-05 10:29:59,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:59,300 INFO L225 Difference]: With dead ends: 52 [2025-02-05 10:29:59,301 INFO L226 Difference]: Without dead ends: 32 [2025-02-05 10:29:59,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:29:59,301 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:29:59,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 32 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:29:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-02-05 10:29:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2025-02-05 10:29:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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-05 10:29:59,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-02-05 10:29:59,308 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 16 [2025-02-05 10:29:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:59,308 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-02-05 10:29:59,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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-05 10:29:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-02-05 10:29:59,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-05 10:29:59,309 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:59,310 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:59,316 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-05 10:29:59,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:59,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:29:59,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:29:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash 388384662, now seen corresponding path program 3 times [2025-02-05 10:29:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:29:59,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112085460] [2025-02-05 10:29:59,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:29:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:29:59,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-02-05 10:29:59,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:29:59,545 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:29:59,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:29:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:29:59,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112085460] [2025-02-05 10:29:59,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112085460] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:29:59,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722667474] [2025-02-05 10:29:59,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 10:29:59,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:29:59,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:29:59,654 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-05 10:29:59,656 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-05 10:29:59,690 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 3 equivalence classes. [2025-02-05 10:29:59,712 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-02-05 10:29:59,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-05 10:29:59,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:29:59,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 10:29:59,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:29:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:29:59,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:29:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:29:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722667474] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:29:59,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:29:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-05 10:29:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870197662] [2025-02-05 10:29:59,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:29:59,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:29:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:29:59,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:29:59,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:29:59,830 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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-05 10:29:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:29:59,926 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2025-02-05 10:29:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:29:59,928 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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 18 [2025-02-05 10:29:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:29:59,928 INFO L225 Difference]: With dead ends: 64 [2025-02-05 10:29:59,928 INFO L226 Difference]: Without dead ends: 50 [2025-02-05 10:29:59,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:29:59,929 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:29:59,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 50 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:29:59,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-05 10:29:59,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2025-02-05 10:29:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 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-05 10:29:59,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-02-05 10:29:59,937 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 18 [2025-02-05 10:29:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:29:59,938 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-02-05 10:29:59,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 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-05 10:29:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-02-05 10:29:59,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:29:59,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:29:59,940 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:29:59,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:30:00,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:00,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:30:00,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:30:00,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1341637222, now seen corresponding path program 1 times [2025-02-05 10:30:00,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:30:00,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611255507] [2025-02-05 10:30:00,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:30:00,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:30:00,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:30:00,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:30:00,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:30:00,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:30:00,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [371919823] [2025-02-05 10:30:00,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:30:00,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:00,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:30:00,178 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-05 10:30:00,180 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-05 10:30:00,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 10:30:00,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:30:00,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:30:00,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:00,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 10:30:00,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:30:00,268 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-05 10:30:00,302 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-05 10:30:00,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2025-02-05 10:30:00,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:00,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2025-02-05 10:30:00,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-05 10:30:00,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:30:00,417 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:30:00,563 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 22 treesize of output 20 [2025-02-05 10:30:00,565 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 18 [2025-02-05 10:30:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:30:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:30:00,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611255507] [2025-02-05 10:30:00,592 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:30:00,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371919823] [2025-02-05 10:30:00,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371919823] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:30:00,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:30:00,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2025-02-05 10:30:00,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360158740] [2025-02-05 10:30:00,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:30:00,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 10:30:00,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:30:00,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 10:30:00,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:30:00,593 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 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-05 10:30:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:30:00,882 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2025-02-05 10:30:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-05 10:30:00,884 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 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 20 [2025-02-05 10:30:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:30:00,885 INFO L225 Difference]: With dead ends: 81 [2025-02-05 10:30:00,885 INFO L226 Difference]: Without dead ends: 68 [2025-02-05 10:30:00,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=546, Unknown=0, NotChecked=0, Total=650 [2025-02-05 10:30:00,887 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 78 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:30:00,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 141 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:30:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-05 10:30:00,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2025-02-05 10:30:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 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-05 10:30:00,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-02-05 10:30:00,895 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 20 [2025-02-05 10:30:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:30:00,895 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-02-05 10:30:00,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 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-05 10:30:00,896 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-02-05 10:30:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 10:30:00,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:30:00,896 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:30:00,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:30:01,096 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,SelfDestructingSolverStorable5 [2025-02-05 10:30:01,097 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:30:01,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:30:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1668108982, now seen corresponding path program 4 times [2025-02-05 10:30:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:30:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551886830] [2025-02-05 10:30:01,097 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:30:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:30:01,109 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-02-05 10:30:01,131 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 10:30:01,131 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-05 10:30:01,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:30:01,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006229272] [2025-02-05 10:30:01,132 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-05 10:30:01,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:01,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:30:01,136 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-05 10:30:01,137 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-05 10:30:01,175 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-02-05 10:30:01,186 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 20 statements. [2025-02-05 10:30:01,186 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-05 10:30:01,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:01,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-05 10:30:01,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:30:01,195 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 20 treesize of output 18 [2025-02-05 10:30:01,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2025-02-05 10:30:01,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:01,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 60 [2025-02-05 10:30:01,353 INFO L349 Elim1Store]: treesize reduction 87, result has 29.8 percent of original size [2025-02-05 10:30:01,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 75 [2025-02-05 10:30:01,422 INFO L349 Elim1Store]: treesize reduction 69, result has 41.5 percent of original size [2025-02-05 10:30:01,423 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 6 case distinctions, treesize of input 78 treesize of output 80 [2025-02-05 10:30:01,508 INFO L349 Elim1Store]: treesize reduction 69, result has 41.5 percent of original size [2025-02-05 10:30:01,508 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 6 case distinctions, treesize of input 86 treesize of output 88 [2025-02-05 10:30:01,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-05 10:30:01,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:01,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2025-02-05 10:30:01,650 INFO L349 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2025-02-05 10:30:01,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 24 [2025-02-05 10:30:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:30:01,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:30:02,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:30:02,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:30:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551886830] [2025-02-05 10:30:02,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:30:02,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006229272] [2025-02-05 10:30:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006229272] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:30:02,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:30:02,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2025-02-05 10:30:02,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390198231] [2025-02-05 10:30:02,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:30:02,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-05 10:30:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:30:02,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-05 10:30:02,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2025-02-05 10:30:02,253 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 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-05 10:30:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:30:04,180 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2025-02-05 10:30:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-02-05 10:30:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 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) Word has length 20 [2025-02-05 10:30:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:30:04,180 INFO L225 Difference]: With dead ends: 98 [2025-02-05 10:30:04,181 INFO L226 Difference]: Without dead ends: 96 [2025-02-05 10:30:04,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=473, Invalid=2719, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 10:30:04,182 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 106 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:30:04,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 214 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:30:04,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-05 10:30:04,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 47. [2025-02-05 10:30:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 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-05 10:30:04,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-02-05 10:30:04,193 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 20 [2025-02-05 10:30:04,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:30:04,193 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-02-05 10:30:04,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 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-05 10:30:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-02-05 10:30:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-05 10:30:04,194 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:30:04,194 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:30:04,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 10:30:04,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:04,409 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:30:04,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:30:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash 108082032, now seen corresponding path program 5 times [2025-02-05 10:30:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:30:04,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016859567] [2025-02-05 10:30:04,410 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:30:04,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:30:04,418 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-02-05 10:30:04,426 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:30:04,427 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-05 10:30:04,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:30:04,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:30:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016859567] [2025-02-05 10:30:04,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016859567] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:30:04,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426648789] [2025-02-05 10:30:04,519 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-05 10:30:04,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:04,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:30:04,521 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-05 10:30:04,523 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-05 10:30:04,555 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-02-05 10:30:04,603 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-02-05 10:30:04,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-05 10:30:04,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:04,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 10:30:04,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:30:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:30:04,646 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:30:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:30:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426648789] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:30:04,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:30:04,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 15 [2025-02-05 10:30:04,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945557716] [2025-02-05 10:30:04,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:30:04,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:30:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:30:04,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:30:04,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:30:04,700 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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-05 10:30:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:30:04,887 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2025-02-05 10:30:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 10:30:04,887 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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 21 [2025-02-05 10:30:04,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:30:04,888 INFO L225 Difference]: With dead ends: 105 [2025-02-05 10:30:04,888 INFO L226 Difference]: Without dead ends: 82 [2025-02-05 10:30:04,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2025-02-05 10:30:04,888 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 77 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:30:04,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 95 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:30:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-05 10:30:04,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 48. [2025-02-05 10:30:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 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-05 10:30:04,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2025-02-05 10:30:04,901 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 21 [2025-02-05 10:30:04,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:30:04,901 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2025-02-05 10:30:04,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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-05 10:30:04,901 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2025-02-05 10:30:04,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-05 10:30:04,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:30:04,902 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:30:04,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 10:30:05,102 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,SelfDestructingSolverStorable7 [2025-02-05 10:30:05,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:30:05,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:30:05,103 INFO L85 PathProgramCache]: Analyzing trace with hash -943469034, now seen corresponding path program 6 times [2025-02-05 10:30:05,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:30:05,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088832592] [2025-02-05 10:30:05,103 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:30:05,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:30:05,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-02-05 10:30:05,124 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:30:05,124 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-05 10:30:05,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:05,234 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:30:05,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:30:05,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088832592] [2025-02-05 10:30:05,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088832592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:30:05,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638936648] [2025-02-05 10:30:05,234 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-05 10:30:05,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:30:05,236 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-05 10:30:05,238 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-05 10:30:05,275 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-02-05 10:30:05,294 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-02-05 10:30:05,294 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-05 10:30:05,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:05,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 10:30:05,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:30:05,349 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:30:05,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:30:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:30:05,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638936648] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:30:05,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:30:05,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-02-05 10:30:05,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729239017] [2025-02-05 10:30:05,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:30:05,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:30:05,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:30:05,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:30:05,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:30:05,386 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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-05 10:30:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:30:05,510 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2025-02-05 10:30:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:30:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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) Word has length 22 [2025-02-05 10:30:05,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:30:05,511 INFO L225 Difference]: With dead ends: 102 [2025-02-05 10:30:05,511 INFO L226 Difference]: Without dead ends: 74 [2025-02-05 10:30:05,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:30:05,512 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:30:05,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 47 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:30:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-05 10:30:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2025-02-05 10:30:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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-05 10:30:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2025-02-05 10:30:05,533 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2025-02-05 10:30:05,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:30:05,533 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2025-02-05 10:30:05,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 16 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-05 10:30:05,533 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2025-02-05 10:30:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-05 10:30:05,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:30:05,534 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:30:05,540 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-05 10:30:05,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:05,734 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:30:05,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:30:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash -183788496, now seen corresponding path program 7 times [2025-02-05 10:30:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:30:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857103889] [2025-02-05 10:30:05,735 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:30:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:30:05,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:30:05,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:30:05,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:30:05,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 10:30:05,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739611783] [2025-02-05 10:30:05,773 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-05 10:30:05,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:30:05,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:30:05,778 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-05 10:30:05,780 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-05 10:30:05,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-05 10:30:05,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-05 10:30:05,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:30:05,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:30:05,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-05 10:30:05,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:30:05,853 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 9 [2025-02-05 10:30:05,867 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 21 treesize of output 20 [2025-02-05 10:30:05,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:05,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:05,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:05,891 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 36 treesize of output 36 [2025-02-05 10:30:05,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:05,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:05,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:05,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:05,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:05,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:05,932 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 49 treesize of output 52 [2025-02-05 10:30:06,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:06,031 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 54 treesize of output 57 [2025-02-05 10:30:06,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:06,097 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 58 treesize of output 48 [2025-02-05 10:30:06,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,168 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2025-02-05 10:30:06,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 53 [2025-02-05 10:30:06,328 INFO L349 Elim1Store]: treesize reduction 78, result has 35.0 percent of original size [2025-02-05 10:30:06,328 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 6 case distinctions, treesize of input 72 treesize of output 78 [2025-02-05 10:30:06,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-05 10:30:06,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:06,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-02-05 10:30:06,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:06,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2025-02-05 10:30:06,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-05 10:30:06,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-05 10:30:06,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2025-02-05 10:30:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:30:06,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:30:08,010 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (= (select (let ((.cse0 (let ((.cse2 (let ((.cse4 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) (.cse3 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_143|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) (.cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_143| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2025-02-05 10:30:09,432 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_143| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (= (select (let ((.cse0 (let ((.cse2 (let ((.cse6 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse4 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ .cse6 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (let ((.cse5 (+ .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))) .cse7 (+ (select .cse4 .cse7) 1))))) (.cse3 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_143|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) (.cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2025-02-05 10:30:13,706 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_318 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (< |v_ULTIMATE.start_main_~i~0#1_143| 2) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (= (select (let ((.cse0 (let ((.cse2 (let ((.cse4 (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_318) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_320) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_322)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse5 (+ (select .cse4 .cse5) 1)))) (.cse3 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_143|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) (.cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_147| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2025-02-05 10:31:11,680 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 758 treesize of output 734 [2025-02-05 10:31:11,756 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-02-05 10:31:11,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47421104738 treesize of output 46810647262 [2025-02-05 10:31:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 12 refuted. 2 times theorem prover too weak. 0 trivial. 11 not checked. [2025-02-05 10:31:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:31:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857103889] [2025-02-05 10:31:14,599 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 10:31:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739611783] [2025-02-05 10:31:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739611783] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:31:14,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:31:14,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2025-02-05 10:31:14,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951704965] [2025-02-05 10:31:14,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:31:14,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-05 10:31:14,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:31:14,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-05 10:31:14,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=738, Unknown=15, NotChecked=180, Total=1122 [2025-02-05 10:31:14,600 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 34 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 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-05 10:31:18,856 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse8 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_318 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (< |v_ULTIMATE.start_main_~i~0#1_143| 2) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (= (select (let ((.cse0 (let ((.cse2 (let ((.cse4 (store (store (store .cse6 .cse7 v_ArrVal_318) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_320) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_322))) (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse5 (+ (select .cse4 .cse5) 1)))) (.cse3 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_143|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) (.cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_147| .cse8))) (= (+ (select .cse6 0) 1) 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_318 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (< |v_ULTIMATE.start_main_~i~0#1_143| 2) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (= (select (let ((.cse9 (let ((.cse11 (let ((.cse13 (store (store (store (store .cse6 .cse7 (+ (* (- 1) |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|) (select .cse6 .cse7))) (+ .cse14 8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_318) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_320) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_322))) (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse5 (+ (select .cse13 .cse5) 1)))) (.cse12 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_143|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) (.cse10 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_147| (+ 2 |c_ULTIMATE.start_main_~i~0#1|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (< |v_ULTIMATE.start_main_~i~0#1_143| 2) (< |v_ULTIMATE.start_main_~i~0#1_146| .cse8) (= (select (let ((.cse15 (let ((.cse17 (let ((.cse19 (store (store .cse6 .cse7 v_ArrVal_320) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_322))) (store (store .cse19 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse19 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse5 (+ (select .cse19 .cse5) 1)))) (.cse18 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_143|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse17 .cse18 (+ (select .cse17 .cse18) 1)))) (.cse16 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse15 .cse16 (+ (select .cse15 .cse16) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))) is different from false [2025-02-05 10:31:22,934 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse7 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~i~0#1_147| Int) (|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int) (v_ArrVal_318 Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (< |v_ULTIMATE.start_main_~i~0#1_143| 2) (< |v_ULTIMATE.start_main_~i~0#1_146| (+ |v_ULTIMATE.start_main_~i~0#1_147| 1)) (= (select (let ((.cse0 (let ((.cse2 (let ((.cse4 (store (store (store .cse6 .cse7 v_ArrVal_318) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_147|)) v_ArrVal_320) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_322))) (store (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse5 (+ (select .cse4 .cse5) 1)))) (.cse3 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_143|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) (.cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (< |v_ULTIMATE.start_main_~i~0#1_147| .cse8))) (forall ((|v_ULTIMATE.start_main_~i~0#1_146| Int) (v_ArrVal_322 Int) (v_ArrVal_320 Int) (|v_ULTIMATE.start_main_~i~0#1_143| Int) (|v_ULTIMATE.start_main_~i~0#1_142| Int)) (or (< |v_ULTIMATE.start_main_~i~0#1_142| (+ |v_ULTIMATE.start_main_~i~0#1_143| 1)) (< |v_ULTIMATE.start_main_~i~0#1_143| 2) (< |v_ULTIMATE.start_main_~i~0#1_146| .cse8) (= (select (let ((.cse9 (let ((.cse11 (let ((.cse13 (store (store .cse6 .cse7 v_ArrVal_320) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_146|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_322))) (store (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) .cse5 (+ (select .cse13 .cse5) 1)))) (.cse12 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_143|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse12 (+ (select .cse11 .cse12) 1)))) (.cse10 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_142|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse9 .cse10 (+ (select .cse9 .cse10) 1))) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) is different from false [2025-02-05 10:31:27,637 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-05 10:31:31,679 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-05 10:31:36,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-02-05 10:31:40,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1]