./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/diamond_1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-acceleration/diamond_1-1.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 bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:54:56,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:54:56,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:54:56,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:54:56,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:54:56,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:54:56,193 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:54:56,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:54:56,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:54:56,193 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:54:56,194 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:54:56,194 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:54:56,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:54:56,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:54:56,195 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:54:56,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:54:56,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:54:56,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:54:56,195 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 -> bd9be28702be20fbd75b67eebfdc5f85895ff340c238c235c391c2a8578e7b23 [2025-01-09 02:54:56,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:54:56,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:54:56,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:54:56,421 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:54:56,422 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:54:56,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2025-01-09 02:54:57,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e7898927/9836ae18c5d24d7e888942220f59283f/FLAG4befa7cc2 [2025-01-09 02:54:57,739 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:54:57,740 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-acceleration/diamond_1-1.c [2025-01-09 02:54:57,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e7898927/9836ae18c5d24d7e888942220f59283f/FLAG4befa7cc2 [2025-01-09 02:54:58,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8e7898927/9836ae18c5d24d7e888942220f59283f [2025-01-09 02:54:58,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:54:58,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:54:58,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:54:58,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:54:58,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:54:58,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bec93e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58, skipping insertion in model container [2025-01-09 02:54:58,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:54:58,211 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/loop-acceleration/diamond_1-1.c[373,386] [2025-01-09 02:54:58,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:54:58,229 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:54:58,236 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/loop-acceleration/diamond_1-1.c[373,386] [2025-01-09 02:54:58,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:54:58,248 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:54:58,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58 WrapperNode [2025-01-09 02:54:58,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:54:58,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:54:58,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:54:58,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:54:58,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,267 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 26 [2025-01-09 02:54:58,267 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:54:58,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:54:58,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:54:58,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:54:58,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,281 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 02:54:58,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,284 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,286 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:54:58,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:54:58,290 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:54:58,290 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:54:58,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (1/1) ... [2025-01-09 02:54:58,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:54:58,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:54:58,321 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:54:58,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:54:58,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:54:58,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:54:58,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:54:58,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:54:58,381 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:54:58,382 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:54:58,443 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 02:54:58,443 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:54:58,448 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:54:58,448 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 02:54:58,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:54:58 BoogieIcfgContainer [2025-01-09 02:54:58,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:54:58,450 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:54:58,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:54:58,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:54:58,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:54:58" (1/3) ... [2025-01-09 02:54:58,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3680a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:54:58, skipping insertion in model container [2025-01-09 02:54:58,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:54:58" (2/3) ... [2025-01-09 02:54:58,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e3680a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:54:58, skipping insertion in model container [2025-01-09 02:54:58,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:54:58" (3/3) ... [2025-01-09 02:54:58,454 INFO L128 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2025-01-09 02:54:58,464 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:54:58,465 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG diamond_1-1.c that has 1 procedures, 11 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 02:54:58,494 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:54:58,501 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;@626b18e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:54:58,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:54:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:58,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 02:54:58,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:54:58,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 02:54:58,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:54:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:54:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash 28702733, now seen corresponding path program 1 times [2025-01-09 02:54:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:54:58,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833410787] [2025-01-09 02:54:58,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:54:58,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:54:58,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 02:54:58,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 02:54:58,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:54:58,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:54:58,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:54:58,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833410787] [2025-01-09 02:54:58,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833410787] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:54:58,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:54:58,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:54:58,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443746191] [2025-01-09 02:54:58,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:54:58,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:54:58,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:54:58,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:54:58,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:54:58,664 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-09 02:54:58,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:54:58,684 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-01-09 02:54:58,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:54:58,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-01-09 02:54:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:54:58,699 INFO L225 Difference]: With dead ends: 20 [2025-01-09 02:54:58,700 INFO L226 Difference]: Without dead ends: 9 [2025-01-09 02:54:58,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:54:58,704 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:54:58,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:54:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-01-09 02:54:58,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2025-01-09 02:54:58,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-01-09 02:54:58,727 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2025-01-09 02:54:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:54:58,727 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-01-09 02:54:58,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-01-09 02:54:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2025-01-09 02:54:58,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-01-09 02:54:58,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:54:58,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:54:58,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:54:58,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:54:58,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:54:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1805891882, now seen corresponding path program 1 times [2025-01-09 02:54:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:54:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599712046] [2025-01-09 02:54:58,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:54:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:54:58,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 02:54:58,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 02:54:58,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:54:58,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:54:58,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:54:58,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599712046] [2025-01-09 02:54:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599712046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:54:58,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449217460] [2025-01-09 02:54:58,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:54:58,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:54:58,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:54:58,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:54:58,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 02:54:58,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-09 02:54:58,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-09 02:54:58,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:54:58,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:58,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 02:54:58,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:54:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:54:58,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:54:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:54:58,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449217460] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:54:58,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:54:58,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 02:54:58,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905921053] [2025-01-09 02:54:58,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:54:58,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 02:54:58,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:54:58,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 02:54:58,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-01-09 02:54:58,965 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:59,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:54:59,011 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2025-01-09 02:54:59,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 02:54:59,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-01-09 02:54:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:54:59,012 INFO L225 Difference]: With dead ends: 19 [2025-01-09 02:54:59,012 INFO L226 Difference]: Without dead ends: 16 [2025-01-09 02:54:59,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-01-09 02:54:59,012 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:54:59,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:54:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-09 02:54:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-01-09 02:54:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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-01-09 02:54:59,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-01-09 02:54:59,015 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 7 [2025-01-09 02:54:59,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:54:59,015 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-01-09 02:54:59,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2025-01-09 02:54:59,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 02:54:59,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:54:59,015 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2025-01-09 02:54:59,021 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-01-09 02:54:59,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:54:59,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:54:59,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:54:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1926318337, now seen corresponding path program 2 times [2025-01-09 02:54:59,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:54:59,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313632523] [2025-01-09 02:54:59,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:54:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:54:59,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-09 02:54:59,245 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 02:54:59,246 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:54:59,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:54:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:54:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313632523] [2025-01-09 02:54:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313632523] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:54:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285985962] [2025-01-09 02:54:59,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:54:59,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:54:59,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:54:59,433 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:54:59,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 02:54:59,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-01-09 02:54:59,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 02:54:59,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:54:59,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:54:59,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 02:54:59,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:54:59,489 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:54:59,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:54:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:54:59,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285985962] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:54:59,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:54:59,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-09 02:54:59,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896289251] [2025-01-09 02:54:59,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:54:59,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 02:54:59,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:54:59,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 02:54:59,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-01-09 02:54:59,575 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-01-09 02:54:59,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:54:59,791 INFO L93 Difference]: Finished difference Result 40 states and 60 transitions. [2025-01-09 02:54:59,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 02:54:59,791 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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 13 [2025-01-09 02:54:59,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:54:59,792 INFO L225 Difference]: With dead ends: 40 [2025-01-09 02:54:59,792 INFO L226 Difference]: Without dead ends: 37 [2025-01-09 02:54:59,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-01-09 02:54:59,793 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 7 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:54:59,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 23 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:54:59,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-01-09 02:54:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2025-01-09 02:54:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:54:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2025-01-09 02:54:59,797 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 13 [2025-01-09 02:54:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:54:59,798 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2025-01-09 02:54:59,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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-01-09 02:54:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2025-01-09 02:54:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 02:54:59,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:54:59,798 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2025-01-09 02:54:59,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 02:55:00,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:00,002 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:00,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:00,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1876367190, now seen corresponding path program 1 times [2025-01-09 02:55:00,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:00,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680210375] [2025-01-09 02:55:00,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:00,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:00,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:55:00,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:55:00,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:00,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 02:55:00,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:00,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680210375] [2025-01-09 02:55:00,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680210375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:55:00,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:55:00,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:55:00,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546641278] [2025-01-09 02:55:00,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:55:00,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:55:00,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:00,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:55:00,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:55:00,028 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-01-09 02:55:00,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:00,038 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2025-01-09 02:55:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:55:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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 19 [2025-01-09 02:55:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:00,039 INFO L225 Difference]: With dead ends: 53 [2025-01-09 02:55:00,039 INFO L226 Difference]: Without dead ends: 39 [2025-01-09 02:55:00,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:55:00,039 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:00,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-01-09 02:55:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-01-09 02:55:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 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-01-09 02:55:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2025-01-09 02:55:00,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 19 [2025-01-09 02:55:00,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:00,067 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2025-01-09 02:55:00,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-01-09 02:55:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2025-01-09 02:55:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 02:55:00,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:00,068 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2025-01-09 02:55:00,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 02:55:00,068 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:00,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash -21640374, now seen corresponding path program 1 times [2025-01-09 02:55:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:00,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211054548] [2025-01-09 02:55:00,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:00,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:00,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:55:00,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:55:00,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:00,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:00,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211054548] [2025-01-09 02:55:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211054548] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985197283] [2025-01-09 02:55:00,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:55:00,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:00,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:00,248 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:00,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 02:55:00,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:55:00,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:55:00,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:55:00,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:00,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 02:55:00,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:00,333 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:00,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:00,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985197283] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:00,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:00,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-01-09 02:55:00,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289473704] [2025-01-09 02:55:00,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:00,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 02:55:00,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:00,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 02:55:00,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2025-01-09 02:55:00,486 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:01,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:01,188 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2025-01-09 02:55:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 02:55:01,189 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 02:55:01,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:01,189 INFO L225 Difference]: With dead ends: 117 [2025-01-09 02:55:01,189 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 02:55:01,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-01-09 02:55:01,190 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:01,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 32 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:55:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 02:55:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 57. [2025-01-09 02:55:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.2142857142857142) internal successors, (68), 56 states have internal predecessors, (68), 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-01-09 02:55:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2025-01-09 02:55:01,208 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 19 [2025-01-09 02:55:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:01,208 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2025-01-09 02:55:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:55:01,209 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2025-01-09 02:55:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 02:55:01,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:01,209 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2025-01-09 02:55:01,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 02:55:01,410 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-01-09 02:55:01,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:01,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash -653467409, now seen corresponding path program 3 times [2025-01-09 02:55:01,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:01,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620038438] [2025-01-09 02:55:01,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:55:01,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:01,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-01-09 02:55:01,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:55:01,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-09 02:55:01,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:01,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:01,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620038438] [2025-01-09 02:55:01,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620038438] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:01,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70292356] [2025-01-09 02:55:01,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:55:01,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:01,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:01,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:01,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 02:55:01,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 11 equivalence classes. [2025-01-09 02:55:01,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 02:55:01,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-09 02:55:01,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:01,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 02:55:01,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:01,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:01,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70292356] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:01,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:01,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-01-09 02:55:01,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440713164] [2025-01-09 02:55:01,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:01,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 02:55:01,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:01,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 02:55:01,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2025-01-09 02:55:01,881 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 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-01-09 02:55:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:04,882 INFO L93 Difference]: Finished difference Result 199 states and 245 transitions. [2025-01-09 02:55:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 02:55:04,883 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 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 25 [2025-01-09 02:55:04,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:04,884 INFO L225 Difference]: With dead ends: 199 [2025-01-09 02:55:04,884 INFO L226 Difference]: Without dead ends: 196 [2025-01-09 02:55:04,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=440, Invalid=750, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 02:55:04,885 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:04,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 02:55:04,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-01-09 02:55:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 81. [2025-01-09 02:55:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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-01-09 02:55:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 104 transitions. [2025-01-09 02:55:04,914 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 104 transitions. Word has length 25 [2025-01-09 02:55:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:04,914 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 104 transitions. [2025-01-09 02:55:04,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 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-01-09 02:55:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 104 transitions. [2025-01-09 02:55:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 02:55:04,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:04,915 INFO L218 NwaCegarLoop]: trace histogram [15, 13, 2, 1, 1, 1, 1, 1] [2025-01-09 02:55:04,920 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-01-09 02:55:05,119 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-01-09 02:55:05,119 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:05,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:05,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1874230310, now seen corresponding path program 2 times [2025-01-09 02:55:05,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:05,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520953475] [2025-01-09 02:55:05,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:55:05,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:05,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-09 02:55:05,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 02:55:05,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:55:05,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 02:55:05,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520953475] [2025-01-09 02:55:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520953475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:55:05,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:55:05,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 02:55:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197535413] [2025-01-09 02:55:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:55:05,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 02:55:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:05,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 02:55:05,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:55:05,142 INFO L87 Difference]: Start difference. First operand 81 states and 104 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 02:55:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:05,154 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2025-01-09 02:55:05,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 02:55:05,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 35 [2025-01-09 02:55:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:05,154 INFO L225 Difference]: With dead ends: 111 [2025-01-09 02:55:05,155 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 02:55:05,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 02:55:05,155 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:05,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:55:05,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 02:55:05,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 02:55:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 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-01-09 02:55:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2025-01-09 02:55:05,165 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 35 [2025-01-09 02:55:05,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:05,165 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2025-01-09 02:55:05,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-01-09 02:55:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2025-01-09 02:55:05,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 02:55:05,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:05,166 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1] [2025-01-09 02:55:05,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 02:55:05,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:05,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:05,166 INFO L85 PathProgramCache]: Analyzing trace with hash -432763971, now seen corresponding path program 2 times [2025-01-09 02:55:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335222459] [2025-01-09 02:55:05,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:55:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:05,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 02:55:05,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:55:05,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:55:05,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:05,418 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:05,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:05,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335222459] [2025-01-09 02:55:05,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335222459] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:05,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131714051] [2025-01-09 02:55:05,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 02:55:05,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:05,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:05,421 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:05,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 02:55:05,445 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-01-09 02:55:05,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 02:55:05,460 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 02:55:05,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:05,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 02:55:05,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:05,504 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:05,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:05,976 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:05,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131714051] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:05,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:05,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2025-01-09 02:55:05,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121655610] [2025-01-09 02:55:05,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:05,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 02:55:05,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:05,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 02:55:05,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 02:55:05,978 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 states have internal predecessors, (73), 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-01-09 02:55:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:55:15,971 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2025-01-09 02:55:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 02:55:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 states have internal predecessors, (73), 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 37 [2025-01-09 02:55:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:55:15,972 INFO L225 Difference]: With dead ends: 120 [2025-01-09 02:55:15,972 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 02:55:15,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=986, Invalid=1770, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 02:55:15,978 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 02:55:15,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 56 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 02:55:15,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 02:55:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-01-09 02:55:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 1.0258620689655173) internal successors, (119), 116 states have internal predecessors, (119), 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-01-09 02:55:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2025-01-09 02:55:16,007 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 37 [2025-01-09 02:55:16,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:55:16,007 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2025-01-09 02:55:16,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.972972972972973) internal successors, (73), 37 states have internal predecessors, (73), 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-01-09 02:55:16,007 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2025-01-09 02:55:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-01-09 02:55:16,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:55:16,008 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1] [2025-01-09 02:55:16,017 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-01-09 02:55:16,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:16,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:55:16,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:55:16,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1291596235, now seen corresponding path program 4 times [2025-01-09 02:55:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:55:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533725183] [2025-01-09 02:55:16,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:55:16,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:55:16,220 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-01-09 02:55:16,230 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 02:55:16,230 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:55:16,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:16,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:55:16,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533725183] [2025-01-09 02:55:16,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533725183] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:55:16,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665976585] [2025-01-09 02:55:16,617 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 02:55:16,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:55:16,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:55:16,619 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:55:16,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 02:55:16,638 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 49 statements into 2 equivalence classes. [2025-01-09 02:55:16,656 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 02:55:16,656 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 02:55:16,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:55:16,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 02:55:16,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:55:16,718 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:16,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:55:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:55:17,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665976585] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:55:17,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:55:17,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-01-09 02:55:17,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770144957] [2025-01-09 02:55:17,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:55:17,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-01-09 02:55:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:55:17,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-01-09 02:55:17,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2025-01-09 02:55:17,432 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 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-01-09 02:56:36,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:56:36,842 INFO L93 Difference]: Finished difference Result 168 states and 193 transitions. [2025-01-09 02:56:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-09 02:56:36,842 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 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 49 [2025-01-09 02:56:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:56:36,844 INFO L225 Difference]: With dead ends: 168 [2025-01-09 02:56:36,844 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 02:56:36,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 79.4s TimeCoverageRelationStatistics Valid=1748, Invalid=3222, Unknown=0, NotChecked=0, Total=4970 [2025-01-09 02:56:36,846 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 02:56:36,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 77 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 02:56:36,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 02:56:36,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-01-09 02:56:36,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 164 states have (on average 1.0182926829268293) internal successors, (167), 164 states have internal predecessors, (167), 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-01-09 02:56:36,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2025-01-09 02:56:36,867 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 49 [2025-01-09 02:56:36,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:56:36,867 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2025-01-09 02:56:36,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.9795918367346939) internal successors, (97), 49 states have internal predecessors, (97), 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-01-09 02:56:36,867 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2025-01-09 02:56:36,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-01-09 02:56:36,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:56:36,871 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1] [2025-01-09 02:56:36,878 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-01-09 02:56:37,076 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,SelfDestructingSolverStorable8 [2025-01-09 02:56:37,076 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:56:37,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:56:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1970276253, now seen corresponding path program 3 times [2025-01-09 02:56:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:56:37,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279827167] [2025-01-09 02:56:37,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 02:56:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:56:37,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 35 equivalence classes. [2025-01-09 02:56:37,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 9 of 73 statements. [2025-01-09 02:56:37,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-09 02:56:37,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:56:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2025-01-09 02:56:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:56:37,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279827167] [2025-01-09 02:56:37,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279827167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:56:37,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:56:37,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 02:56:37,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616470425] [2025-01-09 02:56:37,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:56:37,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 02:56:37,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:56:37,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 02:56:37,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 02:56:37,191 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:56:37,226 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2025-01-09 02:56:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:56:37,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-01-09 02:56:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:56:37,228 INFO L225 Difference]: With dead ends: 168 [2025-01-09 02:56:37,228 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 02:56:37,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:56:37,229 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:56:37,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 13 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:56:37,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 02:56:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 02:56:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.0103092783505154) internal successors, (98), 97 states have internal predecessors, (98), 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-01-09 02:56:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2025-01-09 02:56:37,239 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 73 [2025-01-09 02:56:37,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:56:37,239 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2025-01-09 02:56:37,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:56:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2025-01-09 02:56:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 02:56:37,241 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:56:37,241 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1] [2025-01-09 02:56:37,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 02:56:37,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:56:37,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:56:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 701323139, now seen corresponding path program 5 times [2025-01-09 02:56:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:56:37,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928718920] [2025-01-09 02:56:37,242 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 02:56:37,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:56:37,247 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 97 statements into 47 equivalence classes. [2025-01-09 02:56:37,279 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 02:56:37,283 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-09 02:56:37,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:56:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:56:38,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:56:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928718920] [2025-01-09 02:56:38,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928718920] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 02:56:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761993479] [2025-01-09 02:56:38,539 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 02:56:38,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:56:38,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:56:38,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 02:56:38,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 02:56:38,586 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 97 statements into 47 equivalence classes. [2025-01-09 02:56:39,269 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 02:56:39,270 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-01-09 02:56:39,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:56:39,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-01-09 02:56:39,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 02:56:39,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:56:39,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 02:56:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:56:41,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761993479] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 02:56:41,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 02:56:41,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-01-09 02:56:41,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885145441] [2025-01-09 02:56:41,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 02:56:41,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-01-09 02:56:41,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:56:41,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-01-09 02:56:41,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1505, Invalid=7807, Unknown=0, NotChecked=0, Total=9312 [2025-01-09 02:56:41,747 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 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-01-09 02:56:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:56:43,449 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2025-01-09 02:56:43,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-01-09 02:56:43,450 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 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 97 [2025-01-09 02:56:43,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:56:43,450 INFO L225 Difference]: With dead ends: 109 [2025-01-09 02:56:43,450 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 02:56:43,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1611, Invalid=8091, Unknown=0, NotChecked=0, Total=9702 [2025-01-09 02:56:43,452 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 4491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 02:56:43,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 146 Invalid, 4492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4491 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 02:56:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 02:56:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 02:56:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.0095238095238095) internal successors, (106), 105 states have internal predecessors, (106), 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-01-09 02:56:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2025-01-09 02:56:43,457 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 97 [2025-01-09 02:56:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:56:43,457 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2025-01-09 02:56:43,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.9896907216494846) internal successors, (193), 97 states have internal predecessors, (193), 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-01-09 02:56:43,457 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2025-01-09 02:56:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-01-09 02:56:43,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:56:43,458 INFO L218 NwaCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1] [2025-01-09 02:56:43,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 02:56:43,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 02:56:43,662 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:56:43,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:56:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1352979063, now seen corresponding path program 6 times [2025-01-09 02:56:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:56:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563596332] [2025-01-09 02:56:43,663 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 02:56:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:56:43,667 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 105 statements into 51 equivalence classes. [2025-01-09 02:56:43,723 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 02:56:43,724 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2025-01-09 02:56:43,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat