./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label55.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label55.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 892d3c9e0b7c167d810581087b0633fb7bb5cd8a7fe1ab934154adc1945085ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:48:55,898 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:48:55,969 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:48:55,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:48:55,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:48:55,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:48:55,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:48:55,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:48:55,986 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:48:55,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:48:55,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:48:55,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:48:55,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:48:55,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:48:55,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:48:55,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:48:55,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:48:55,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:48:55,988 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 -> 892d3c9e0b7c167d810581087b0633fb7bb5cd8a7fe1ab934154adc1945085ff [2025-02-05 10:48:56,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:48:56,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:48:56,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:48:56,243 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:48:56,243 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:48:56,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label55.c [2025-02-05 10:48:57,332 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c2635662/4b04976dd1964d6da30aa1f03ad2f894/FLAG2bc20cf08 [2025-02-05 10:48:57,670 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:48:57,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label55.c [2025-02-05 10:48:57,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c2635662/4b04976dd1964d6da30aa1f03ad2f894/FLAG2bc20cf08 [2025-02-05 10:48:57,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c2635662/4b04976dd1964d6da30aa1f03ad2f894 [2025-02-05 10:48:57,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:48:57,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:48:57,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:48:57,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:48:57,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:48:57,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:48:57" (1/1) ... [2025-02-05 10:48:57,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2807f973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:57, skipping insertion in model container [2025-02-05 10:48:57,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:48:57" (1/1) ... [2025-02-05 10:48:57,953 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:48:58,323 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/eca-rers2012/Problem03_label55.c[56086,56099] [2025-02-05 10:48:58,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:48:58,357 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:48:58,488 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/eca-rers2012/Problem03_label55.c[56086,56099] [2025-02-05 10:48:58,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:48:58,522 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:48:58,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58 WrapperNode [2025-02-05 10:48:58,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:48:58,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:48:58,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:48:58,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:48:58,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,652 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-02-05 10:48:58,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:48:58,653 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:48:58,653 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:48:58,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:48:58,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,675 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,706 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-02-05 10:48:58,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,753 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:48:58,769 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:48:58,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:48:58,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:48:58,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (1/1) ... [2025-02-05 10:48:58,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:48:58,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:48:58,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:48:58,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:48:58,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:48:58,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:48:58,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:48:58,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:48:58,879 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:48:58,881 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:49:00,324 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-02-05 10:49:00,324 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:49:00,341 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:49:00,341 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:49:00,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:49:00 BoogieIcfgContainer [2025-02-05 10:49:00,342 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:49:00,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:49:00,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:49:00,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:49:00,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:48:57" (1/3) ... [2025-02-05 10:49:00,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9818b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:49:00, skipping insertion in model container [2025-02-05 10:49:00,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:48:58" (2/3) ... [2025-02-05 10:49:00,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c9818b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:49:00, skipping insertion in model container [2025-02-05 10:49:00,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:49:00" (3/3) ... [2025-02-05 10:49:00,362 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label55.c [2025-02-05 10:49:00,385 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:49:00,391 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label55.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:49:00,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:49:00,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;@4e6f24ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:49:00,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:49:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 10:49:00,526 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:00,527 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:00,527 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:00,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:00,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1338661207, now seen corresponding path program 1 times [2025-02-05 10:49:00,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:00,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774600010] [2025-02-05 10:49:00,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:00,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:00,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 10:49:00,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 10:49:00,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:00,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:01,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:01,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:01,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774600010] [2025-02-05 10:49:01,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774600010] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:01,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:01,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:49:01,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947113451] [2025-02-05 10:49:01,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:01,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:01,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:01,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:01,332 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:02,089 INFO L93 Difference]: Finished difference Result 860 states and 1504 transitions. [2025-02-05 10:49:02,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:02,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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 162 [2025-02-05 10:49:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:02,101 INFO L225 Difference]: With dead ends: 860 [2025-02-05 10:49:02,107 INFO L226 Difference]: Without dead ends: 465 [2025-02-05 10:49:02,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:02,116 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 142 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:02,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 170 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:49:02,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-02-05 10:49:02,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2025-02-05 10:49:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2025-02-05 10:49:02,184 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 162 [2025-02-05 10:49:02,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:02,186 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2025-02-05 10:49:02,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2025-02-05 10:49:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 10:49:02,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:02,189 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:02,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:49:02,189 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:02,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:02,192 INFO L85 PathProgramCache]: Analyzing trace with hash -289990867, now seen corresponding path program 1 times [2025-02-05 10:49:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:02,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85552846] [2025-02-05 10:49:02,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:02,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 10:49:02,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 10:49:02,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:02,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:02,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:02,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85552846] [2025-02-05 10:49:02,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85552846] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:02,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:02,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:49:02,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380035779] [2025-02-05 10:49:02,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:02,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:02,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:02,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:02,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:02,396 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:03,116 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2025-02-05 10:49:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:03,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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 170 [2025-02-05 10:49:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:03,120 INFO L225 Difference]: With dead ends: 1343 [2025-02-05 10:49:03,120 INFO L226 Difference]: Without dead ends: 886 [2025-02-05 10:49:03,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:03,122 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:03,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:49:03,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-02-05 10:49:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2025-02-05 10:49:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.5340253748558246) internal successors, (1330), 867 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2025-02-05 10:49:03,167 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 170 [2025-02-05 10:49:03,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:03,167 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2025-02-05 10:49:03,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:03,167 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2025-02-05 10:49:03,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 10:49:03,174 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:03,175 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:03,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:49:03,175 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:03,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:03,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1354518775, now seen corresponding path program 1 times [2025-02-05 10:49:03,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:03,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379842201] [2025-02-05 10:49:03,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:03,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:03,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 10:49:03,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 10:49:03,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:03,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:03,421 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:03,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:03,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379842201] [2025-02-05 10:49:03,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379842201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:03,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:03,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:49:03,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603524409] [2025-02-05 10:49:03,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:03,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:03,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:03,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:03,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:03,423 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:04,020 INFO L93 Difference]: Finished difference Result 2546 states and 3911 transitions. [2025-02-05 10:49:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:04,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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 171 [2025-02-05 10:49:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:04,026 INFO L225 Difference]: With dead ends: 2546 [2025-02-05 10:49:04,027 INFO L226 Difference]: Without dead ends: 1680 [2025-02-05 10:49:04,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:04,029 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 213 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:04,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 192 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:49:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2025-02-05 10:49:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1680. [2025-02-05 10:49:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1679 states have (on average 1.3442525312686122) internal successors, (2257), 1679 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:04,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2257 transitions. [2025-02-05 10:49:04,054 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2257 transitions. Word has length 171 [2025-02-05 10:49:04,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:04,055 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2257 transitions. [2025-02-05 10:49:04,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2257 transitions. [2025-02-05 10:49:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 10:49:04,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:04,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:04,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:49:04,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:04,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:04,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2018858915, now seen corresponding path program 1 times [2025-02-05 10:49:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:04,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540501791] [2025-02-05 10:49:04,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:04,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:04,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 10:49:04,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 10:49:04,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:04,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:04,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:04,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540501791] [2025-02-05 10:49:04,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540501791] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:04,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:04,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:49:04,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991756114] [2025-02-05 10:49:04,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:04,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:04,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:04,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:04,368 INFO L87 Difference]: Start difference. First operand 1680 states and 2257 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:05,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:05,107 INFO L93 Difference]: Finished difference Result 5010 states and 6731 transitions. [2025-02-05 10:49:05,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:05,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 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 174 [2025-02-05 10:49:05,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:05,117 INFO L225 Difference]: With dead ends: 5010 [2025-02-05 10:49:05,117 INFO L226 Difference]: Without dead ends: 3332 [2025-02-05 10:49:05,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:05,122 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:05,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 98 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:49:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2025-02-05 10:49:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 3329. [2025-02-05 10:49:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3329 states, 3328 states have (on average 1.3209134615384615) internal successors, (4396), 3328 states have internal predecessors, (4396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 4396 transitions. [2025-02-05 10:49:05,180 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 4396 transitions. Word has length 174 [2025-02-05 10:49:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:05,180 INFO L471 AbstractCegarLoop]: Abstraction has 3329 states and 4396 transitions. [2025-02-05 10:49:05,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 4396 transitions. [2025-02-05 10:49:05,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-02-05 10:49:05,184 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:05,184 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:05,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:49:05,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:05,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1954089294, now seen corresponding path program 1 times [2025-02-05 10:49:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703105374] [2025-02-05 10:49:05,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:05,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:05,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 10:49:05,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 10:49:05,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:05,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:05,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:05,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703105374] [2025-02-05 10:49:05,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703105374] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:05,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310978019] [2025-02-05 10:49:05,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:05,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:05,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:05,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:49:05,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-02-05 10:49:05,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-02-05 10:49:05,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:05,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:05,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:49:05,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:49:05,781 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310978019] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:05,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:05,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:49:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415123277] [2025-02-05 10:49:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:05,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:05,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:05,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:05,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:49:05,783 INFO L87 Difference]: Start difference. First operand 3329 states and 4396 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:06,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:06,490 INFO L93 Difference]: Finished difference Result 8287 states and 11245 transitions. [2025-02-05 10:49:06,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:06,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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 177 [2025-02-05 10:49:06,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:06,505 INFO L225 Difference]: With dead ends: 8287 [2025-02-05 10:49:06,505 INFO L226 Difference]: Without dead ends: 4960 [2025-02-05 10:49:06,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:49:06,510 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 79 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:06,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 401 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:49:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2025-02-05 10:49:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4956. [2025-02-05 10:49:06,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4956 states, 4955 states have (on average 1.2591321897073664) internal successors, (6239), 4955 states have internal predecessors, (6239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4956 states to 4956 states and 6239 transitions. [2025-02-05 10:49:06,586 INFO L78 Accepts]: Start accepts. Automaton has 4956 states and 6239 transitions. Word has length 177 [2025-02-05 10:49:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:06,587 INFO L471 AbstractCegarLoop]: Abstraction has 4956 states and 6239 transitions. [2025-02-05 10:49:06,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4956 states and 6239 transitions. [2025-02-05 10:49:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 10:49:06,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:06,593 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:06,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:49:06,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:06,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:06,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:06,798 INFO L85 PathProgramCache]: Analyzing trace with hash 871803687, now seen corresponding path program 1 times [2025-02-05 10:49:06,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:06,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197571630] [2025-02-05 10:49:06,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:06,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 10:49:06,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 10:49:06,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:06,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:49:07,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:07,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197571630] [2025-02-05 10:49:07,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197571630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:07,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:07,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:49:07,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96033673] [2025-02-05 10:49:07,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:07,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:49:07,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:07,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:49:07,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:49:07,003 INFO L87 Difference]: Start difference. First operand 4956 states and 6239 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:07,741 INFO L93 Difference]: Finished difference Result 9895 states and 12461 transitions. [2025-02-05 10:49:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:49:07,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 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 218 [2025-02-05 10:49:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:07,756 INFO L225 Difference]: With dead ends: 9895 [2025-02-05 10:49:07,756 INFO L226 Difference]: Without dead ends: 4941 [2025-02-05 10:49:07,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:49:07,762 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 799 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:07,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 43 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:49:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4941 states. [2025-02-05 10:49:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4941 to 4929. [2025-02-05 10:49:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4929 states, 4928 states have (on average 1.2268668831168832) internal successors, (6046), 4928 states have internal predecessors, (6046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:07,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 6046 transitions. [2025-02-05 10:49:07,831 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 6046 transitions. Word has length 218 [2025-02-05 10:49:07,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:07,831 INFO L471 AbstractCegarLoop]: Abstraction has 4929 states and 6046 transitions. [2025-02-05 10:49:07,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 3 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:07,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 6046 transitions. [2025-02-05 10:49:07,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 10:49:07,835 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:07,835 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:07,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:49:07,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:07,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash -769428282, now seen corresponding path program 1 times [2025-02-05 10:49:07,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:07,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469040722] [2025-02-05 10:49:07,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:07,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:07,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 10:49:07,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 10:49:07,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:07,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:08,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:08,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469040722] [2025-02-05 10:49:08,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469040722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:08,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:08,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:49:08,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951320805] [2025-02-05 10:49:08,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:08,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:08,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:08,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:08,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:08,211 INFO L87 Difference]: Start difference. First operand 4929 states and 6046 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:08,752 INFO L93 Difference]: Finished difference Result 11498 states and 13972 transitions. [2025-02-05 10:49:08,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:08,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 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 225 [2025-02-05 10:49:08,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:08,769 INFO L225 Difference]: With dead ends: 11498 [2025-02-05 10:49:08,769 INFO L226 Difference]: Without dead ends: 6571 [2025-02-05 10:49:08,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:08,775 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:08,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 114 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:49:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6571 states. [2025-02-05 10:49:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6571 to 6567. [2025-02-05 10:49:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6567 states, 6566 states have (on average 1.2028632348461772) internal successors, (7898), 6566 states have internal predecessors, (7898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:08,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6567 states to 6567 states and 7898 transitions. [2025-02-05 10:49:08,868 INFO L78 Accepts]: Start accepts. Automaton has 6567 states and 7898 transitions. Word has length 225 [2025-02-05 10:49:08,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:08,869 INFO L471 AbstractCegarLoop]: Abstraction has 6567 states and 7898 transitions. [2025-02-05 10:49:08,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 6567 states and 7898 transitions. [2025-02-05 10:49:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-05 10:49:08,874 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:08,874 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:08,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:49:08,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:08,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:08,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1411529823, now seen corresponding path program 1 times [2025-02-05 10:49:08,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:08,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732578785] [2025-02-05 10:49:08,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:08,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 10:49:08,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 10:49:08,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:08,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:09,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:09,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732578785] [2025-02-05 10:49:09,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732578785] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:09,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958013873] [2025-02-05 10:49:09,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:09,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:09,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:09,235 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:09,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:49:09,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-05 10:49:09,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-05 10:49:09,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:09,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:09,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:49:09,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:09,567 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958013873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:09,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:09,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-02-05 10:49:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567928569] [2025-02-05 10:49:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:09,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:09,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:09,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:09,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:49:09,568 INFO L87 Difference]: Start difference. First operand 6567 states and 7898 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:10,186 INFO L93 Difference]: Finished difference Result 18414 states and 22161 transitions. [2025-02-05 10:49:10,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:10,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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 232 [2025-02-05 10:49:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:10,212 INFO L225 Difference]: With dead ends: 18414 [2025-02-05 10:49:10,212 INFO L226 Difference]: Without dead ends: 11849 [2025-02-05 10:49:10,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:49:10,222 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 154 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:10,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 148 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:49:10,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2025-02-05 10:49:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11847. [2025-02-05 10:49:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11846 states have (on average 1.1652878608813102) internal successors, (13804), 11846 states have internal predecessors, (13804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 13804 transitions. [2025-02-05 10:49:10,359 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 13804 transitions. Word has length 232 [2025-02-05 10:49:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:10,360 INFO L471 AbstractCegarLoop]: Abstraction has 11847 states and 13804 transitions. [2025-02-05 10:49:10,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 13804 transitions. [2025-02-05 10:49:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-02-05 10:49:10,367 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:10,367 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:10,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 10:49:10,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:10,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:10,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1471801408, now seen corresponding path program 1 times [2025-02-05 10:49:10,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:10,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210258922] [2025-02-05 10:49:10,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:10,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 10:49:10,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 10:49:10,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:10,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-02-05 10:49:11,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:11,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210258922] [2025-02-05 10:49:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210258922] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92267141] [2025-02-05 10:49:11,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:11,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:11,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:11,379 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:11,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 10:49:11,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-02-05 10:49:11,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-02-05 10:49:11,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:11,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:11,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:49:11,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-02-05 10:49:11,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:11,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92267141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:11,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:11,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:49:11,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18853417] [2025-02-05 10:49:11,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:11,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:11,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:11,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:11,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:11,651 INFO L87 Difference]: Start difference. First operand 11847 states and 13804 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:12,253 INFO L93 Difference]: Finished difference Result 23704 states and 27628 transitions. [2025-02-05 10:49:12,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:12,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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 241 [2025-02-05 10:49:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:12,270 INFO L225 Difference]: With dead ends: 23704 [2025-02-05 10:49:12,270 INFO L226 Difference]: Without dead ends: 11859 [2025-02-05 10:49:12,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:12,280 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 63 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:12,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 359 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:49:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11859 states. [2025-02-05 10:49:12,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11859 to 11847. [2025-02-05 10:49:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11847 states, 11846 states have (on average 1.1519500253250041) internal successors, (13646), 11846 states have internal predecessors, (13646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11847 states to 11847 states and 13646 transitions. [2025-02-05 10:49:12,401 INFO L78 Accepts]: Start accepts. Automaton has 11847 states and 13646 transitions. Word has length 241 [2025-02-05 10:49:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:12,402 INFO L471 AbstractCegarLoop]: Abstraction has 11847 states and 13646 transitions. [2025-02-05 10:49:12,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 11847 states and 13646 transitions. [2025-02-05 10:49:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-05 10:49:12,410 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:12,410 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:12,420 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:49:12,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:12,612 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:12,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:12,612 INFO L85 PathProgramCache]: Analyzing trace with hash 612071711, now seen corresponding path program 1 times [2025-02-05 10:49:12,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:12,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268869083] [2025-02-05 10:49:12,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:12,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:12,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 10:49:12,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 10:49:12,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:12,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268869083] [2025-02-05 10:49:13,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268869083] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417281761] [2025-02-05 10:49:13,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:13,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:13,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:13,679 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:13,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:49:13,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 10:49:13,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 10:49:13,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:13,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:13,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:49:13,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 10:49:14,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:14,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417281761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:14,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:14,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 10:49:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766849405] [2025-02-05 10:49:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:14,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:14,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:14,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:14,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:14,061 INFO L87 Difference]: Start difference. First operand 11847 states and 13646 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:14,720 INFO L93 Difference]: Finished difference Result 34290 states and 39497 transitions. [2025-02-05 10:49:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:14,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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 258 [2025-02-05 10:49:14,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:14,756 INFO L225 Difference]: With dead ends: 34290 [2025-02-05 10:49:14,756 INFO L226 Difference]: Without dead ends: 22445 [2025-02-05 10:49:14,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:14,771 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 67 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:14,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 126 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:49:14,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22445 states. [2025-02-05 10:49:15,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22445 to 19580. [2025-02-05 10:49:15,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19580 states, 19579 states have (on average 1.1594565606006435) internal successors, (22701), 19579 states have internal predecessors, (22701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19580 states to 19580 states and 22701 transitions. [2025-02-05 10:49:15,066 INFO L78 Accepts]: Start accepts. Automaton has 19580 states and 22701 transitions. Word has length 258 [2025-02-05 10:49:15,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:15,067 INFO L471 AbstractCegarLoop]: Abstraction has 19580 states and 22701 transitions. [2025-02-05 10:49:15,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:15,067 INFO L276 IsEmpty]: Start isEmpty. Operand 19580 states and 22701 transitions. [2025-02-05 10:49:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 10:49:15,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:15,079 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:15,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:49:15,279 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,SelfDestructingSolverStorable9 [2025-02-05 10:49:15,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:15,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1335445888, now seen corresponding path program 1 times [2025-02-05 10:49:15,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:15,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426256267] [2025-02-05 10:49:15,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:15,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:15,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 10:49:15,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 10:49:15,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:15,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:15,394 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:15,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:15,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426256267] [2025-02-05 10:49:15,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426256267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:15,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:15,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:49:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172244965] [2025-02-05 10:49:15,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:15,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:15,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:15,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:15,397 INFO L87 Difference]: Start difference. First operand 19580 states and 22701 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:16,068 INFO L93 Difference]: Finished difference Result 48906 states and 57051 transitions. [2025-02-05 10:49:16,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:16,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 273 [2025-02-05 10:49:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:16,112 INFO L225 Difference]: With dead ends: 48906 [2025-02-05 10:49:16,113 INFO L226 Difference]: Without dead ends: 29328 [2025-02-05 10:49:16,132 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-02-05 10:49:16,133 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 239 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:16,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 326 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:49:16,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29328 states. [2025-02-05 10:49:16,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29328 to 29326. [2025-02-05 10:49:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29326 states, 29325 states have (on average 1.1394373401534528) internal successors, (33414), 29325 states have internal predecessors, (33414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:16,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29326 states to 29326 states and 33414 transitions. [2025-02-05 10:49:16,390 INFO L78 Accepts]: Start accepts. Automaton has 29326 states and 33414 transitions. Word has length 273 [2025-02-05 10:49:16,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:16,391 INFO L471 AbstractCegarLoop]: Abstraction has 29326 states and 33414 transitions. [2025-02-05 10:49:16,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 29326 states and 33414 transitions. [2025-02-05 10:49:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-02-05 10:49:16,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:16,405 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:16,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:49:16,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:16,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1486652448, now seen corresponding path program 1 times [2025-02-05 10:49:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528516305] [2025-02-05 10:49:16,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:16,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-02-05 10:49:16,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-02-05 10:49:16,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:16,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:16,519 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:49:16,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:16,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528516305] [2025-02-05 10:49:16,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528516305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:49:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790116762] [2025-02-05 10:49:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:16,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:16,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:16,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:16,520 INFO L87 Difference]: Start difference. First operand 29326 states and 33414 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:17,253 INFO L93 Difference]: Finished difference Result 71445 states and 81299 transitions. [2025-02-05 10:49:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:17,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 285 [2025-02-05 10:49:17,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:17,296 INFO L225 Difference]: With dead ends: 71445 [2025-02-05 10:49:17,296 INFO L226 Difference]: Without dead ends: 42121 [2025-02-05 10:49:17,307 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-02-05 10:49:17,308 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 222 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:17,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 307 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:49:17,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42121 states. [2025-02-05 10:49:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42121 to 36226. [2025-02-05 10:49:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36226 states, 36225 states have (on average 1.1118288474810214) internal successors, (40276), 36225 states have internal predecessors, (40276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36226 states to 36226 states and 40276 transitions. [2025-02-05 10:49:17,650 INFO L78 Accepts]: Start accepts. Automaton has 36226 states and 40276 transitions. Word has length 285 [2025-02-05 10:49:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:17,650 INFO L471 AbstractCegarLoop]: Abstraction has 36226 states and 40276 transitions. [2025-02-05 10:49:17,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:17,651 INFO L276 IsEmpty]: Start isEmpty. Operand 36226 states and 40276 transitions. [2025-02-05 10:49:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2025-02-05 10:49:17,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:17,673 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:17,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:49:17,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:17,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1576168685, now seen corresponding path program 1 times [2025-02-05 10:49:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:17,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130691794] [2025-02-05 10:49:17,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:17,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:17,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-05 10:49:17,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-05 10:49:17,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:17,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2025-02-05 10:49:18,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130691794] [2025-02-05 10:49:18,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130691794] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558298399] [2025-02-05 10:49:18,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:18,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:18,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:18,720 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:18,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:49:18,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 368 statements into 1 equivalence classes. [2025-02-05 10:49:18,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 368 of 368 statements. [2025-02-05 10:49:18,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:18,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:18,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:49:18,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-02-05 10:49:19,044 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:19,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558298399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:19,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:19,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 10:49:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685598249] [2025-02-05 10:49:19,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:19,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:19,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:19,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:19,046 INFO L87 Difference]: Start difference. First operand 36226 states and 40276 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:19,302 INFO L93 Difference]: Finished difference Result 108262 states and 120390 transitions. [2025-02-05 10:49:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:19,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 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 368 [2025-02-05 10:49:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:19,384 INFO L225 Difference]: With dead ends: 108262 [2025-02-05 10:49:19,384 INFO L226 Difference]: Without dead ends: 72038 [2025-02-05 10:49:19,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:19,420 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 219 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:19,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 700 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:49:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72038 states. [2025-02-05 10:49:20,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72038 to 72034. [2025-02-05 10:49:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72034 states, 72033 states have (on average 1.112143045548568) internal successors, (80111), 72033 states have internal predecessors, (80111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72034 states to 72034 states and 80111 transitions. [2025-02-05 10:49:20,348 INFO L78 Accepts]: Start accepts. Automaton has 72034 states and 80111 transitions. Word has length 368 [2025-02-05 10:49:20,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:20,349 INFO L471 AbstractCegarLoop]: Abstraction has 72034 states and 80111 transitions. [2025-02-05 10:49:20,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 2 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 72034 states and 80111 transitions. [2025-02-05 10:49:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2025-02-05 10:49:20,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:20,382 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:20,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 10:49:20,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 10:49:20,583 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:20,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1138836649, now seen corresponding path program 1 times [2025-02-05 10:49:20,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:20,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803019892] [2025-02-05 10:49:20,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:20,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:20,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 394 statements into 1 equivalence classes. [2025-02-05 10:49:20,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 394 of 394 statements. [2025-02-05 10:49:20,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:20,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-02-05 10:49:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803019892] [2025-02-05 10:49:20,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803019892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:20,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:49:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529051175] [2025-02-05 10:49:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:20,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:20,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:20,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:20,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:49:20,756 INFO L87 Difference]: Start difference. First operand 72034 states and 80111 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:21,543 INFO L93 Difference]: Finished difference Result 135120 states and 149935 transitions. [2025-02-05 10:49:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:21,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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 394 [2025-02-05 10:49:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:21,611 INFO L225 Difference]: With dead ends: 135120 [2025-02-05 10:49:21,611 INFO L226 Difference]: Without dead ends: 63088 [2025-02-05 10:49:21,654 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-02-05 10:49:21,655 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 225 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:21,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 323 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:49:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63088 states. [2025-02-05 10:49:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63088 to 63072. [2025-02-05 10:49:22,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63072 states, 63071 states have (on average 1.0961297585261054) internal successors, (69134), 63071 states have internal predecessors, (69134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:22,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63072 states to 63072 states and 69134 transitions. [2025-02-05 10:49:22,560 INFO L78 Accepts]: Start accepts. Automaton has 63072 states and 69134 transitions. Word has length 394 [2025-02-05 10:49:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:22,560 INFO L471 AbstractCegarLoop]: Abstraction has 63072 states and 69134 transitions. [2025-02-05 10:49:22,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 63072 states and 69134 transitions. [2025-02-05 10:49:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-02-05 10:49:22,591 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:22,591 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:22,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 10:49:22,591 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:22,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:22,592 INFO L85 PathProgramCache]: Analyzing trace with hash 265601009, now seen corresponding path program 1 times [2025-02-05 10:49:22,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:22,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764201441] [2025-02-05 10:49:22,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:22,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-02-05 10:49:22,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-02-05 10:49:22,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:22,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:24,174 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 129 proven. 6 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-02-05 10:49:24,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:24,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764201441] [2025-02-05 10:49:24,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764201441] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:24,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638456415] [2025-02-05 10:49:24,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:24,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:24,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:24,178 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:24,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:49:24,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-02-05 10:49:24,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-02-05 10:49:24,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:24,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:24,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:49:24,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-02-05 10:49:24,470 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:24,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638456415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:24,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:24,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:49:24,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977822715] [2025-02-05 10:49:24,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:24,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:24,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:24,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:24,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:24,471 INFO L87 Difference]: Start difference. First operand 63072 states and 69134 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:25,199 INFO L93 Difference]: Finished difference Result 126146 states and 138272 transitions. [2025-02-05 10:49:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:25,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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 465 [2025-02-05 10:49:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:25,265 INFO L225 Difference]: With dead ends: 126146 [2025-02-05 10:49:25,266 INFO L226 Difference]: Without dead ends: 63076 [2025-02-05 10:49:25,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 464 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:25,305 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 121 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:25,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 105 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:49:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63076 states. [2025-02-05 10:49:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63076 to 62256. [2025-02-05 10:49:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62256 states, 62255 states have (on average 1.0875913581238454) internal successors, (67708), 62255 states have internal predecessors, (67708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:26,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62256 states to 62256 states and 67708 transitions. [2025-02-05 10:49:26,009 INFO L78 Accepts]: Start accepts. Automaton has 62256 states and 67708 transitions. Word has length 465 [2025-02-05 10:49:26,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:26,009 INFO L471 AbstractCegarLoop]: Abstraction has 62256 states and 67708 transitions. [2025-02-05 10:49:26,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:26,010 INFO L276 IsEmpty]: Start isEmpty. Operand 62256 states and 67708 transitions. [2025-02-05 10:49:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-05 10:49:26,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:26,051 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:26,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 10:49:26,252 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,SelfDestructingSolverStorable14 [2025-02-05 10:49:26,252 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:26,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:26,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1044538447, now seen corresponding path program 1 times [2025-02-05 10:49:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:26,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279166423] [2025-02-05 10:49:26,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:26,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:26,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-05 10:49:26,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-05 10:49:26,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:26,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-02-05 10:49:27,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:27,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279166423] [2025-02-05 10:49:27,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279166423] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:27,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897263313] [2025-02-05 10:49:27,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:27,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:27,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:27,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:27,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:49:27,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-05 10:49:27,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-05 10:49:27,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:27,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:27,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 10:49:27,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 10:49:28,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:28,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897263313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:28,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:28,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2025-02-05 10:49:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817799113] [2025-02-05 10:49:28,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:28,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:49:28,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:28,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:49:28,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:49:28,340 INFO L87 Difference]: Start difference. First operand 62256 states and 67708 transitions. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:29,573 INFO L93 Difference]: Finished difference Result 184105 states and 200508 transitions. [2025-02-05 10:49:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:49:29,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 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 482 [2025-02-05 10:49:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:29,691 INFO L225 Difference]: With dead ends: 184105 [2025-02-05 10:49:29,691 INFO L226 Difference]: Without dead ends: 121851 [2025-02-05 10:49:29,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:49:29,737 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 794 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:29,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 495 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 10:49:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121851 states. [2025-02-05 10:49:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121851 to 116153. [2025-02-05 10:49:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116153 states, 116152 states have (on average 1.088410014463806) internal successors, (126421), 116152 states have internal predecessors, (126421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:31,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116153 states to 116153 states and 126421 transitions. [2025-02-05 10:49:31,055 INFO L78 Accepts]: Start accepts. Automaton has 116153 states and 126421 transitions. Word has length 482 [2025-02-05 10:49:31,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:31,055 INFO L471 AbstractCegarLoop]: Abstraction has 116153 states and 126421 transitions. [2025-02-05 10:49:31,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:31,055 INFO L276 IsEmpty]: Start isEmpty. Operand 116153 states and 126421 transitions. [2025-02-05 10:49:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2025-02-05 10:49:31,110 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:31,110 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:31,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 10:49:31,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:31,315 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:31,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:31,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1949180413, now seen corresponding path program 1 times [2025-02-05 10:49:31,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017818040] [2025-02-05 10:49:31,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:31,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes. [2025-02-05 10:49:31,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements. [2025-02-05 10:49:31,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:31,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 531 trivial. 0 not checked. [2025-02-05 10:49:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:31,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017818040] [2025-02-05 10:49:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017818040] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:31,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:49:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:49:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464243239] [2025-02-05 10:49:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:49:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:31,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:49:31,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:49:31,809 INFO L87 Difference]: Start difference. First operand 116153 states and 126421 transitions. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:33,478 INFO L93 Difference]: Finished difference Result 264444 states and 287794 transitions. [2025-02-05 10:49:33,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:49:33,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 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 496 [2025-02-05 10:49:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:33,675 INFO L225 Difference]: With dead ends: 264444 [2025-02-05 10:49:33,675 INFO L226 Difference]: Without dead ends: 148293 [2025-02-05 10:49:33,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:49:33,760 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 348 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:33,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 91 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 10:49:33,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148293 states. [2025-02-05 10:49:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148293 to 136047. [2025-02-05 10:49:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136047 states, 136046 states have (on average 1.074144039516046) internal successors, (146133), 136046 states have internal predecessors, (146133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:35,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136047 states to 136047 states and 146133 transitions. [2025-02-05 10:49:35,741 INFO L78 Accepts]: Start accepts. Automaton has 136047 states and 146133 transitions. Word has length 496 [2025-02-05 10:49:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:35,741 INFO L471 AbstractCegarLoop]: Abstraction has 136047 states and 146133 transitions. [2025-02-05 10:49:35,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 136047 states and 146133 transitions. [2025-02-05 10:49:35,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2025-02-05 10:49:35,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:35,794 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:35,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:49:35,794 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:35,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:35,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1109380281, now seen corresponding path program 1 times [2025-02-05 10:49:35,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:35,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962352479] [2025-02-05 10:49:35,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:35,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:35,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-02-05 10:49:35,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-02-05 10:49:35,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:35,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 203 proven. 6 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2025-02-05 10:49:37,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:37,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962352479] [2025-02-05 10:49:37,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962352479] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:37,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161982721] [2025-02-05 10:49:37,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:37,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:37,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:37,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:37,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:49:37,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes. [2025-02-05 10:49:37,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements. [2025-02-05 10:49:37,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:37,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:37,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:49:37,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1043 backedges. 787 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-02-05 10:49:37,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:37,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161982721] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:37,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:37,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:49:37,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402440206] [2025-02-05 10:49:37,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:37,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:37,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:37,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:37,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:37,977 INFO L87 Difference]: Start difference. First operand 136047 states and 146133 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:39,060 INFO L93 Difference]: Finished difference Result 378648 states and 407047 transitions. [2025-02-05 10:49:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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 584 [2025-02-05 10:49:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:39,342 INFO L225 Difference]: With dead ends: 378648 [2025-02-05 10:49:39,343 INFO L226 Difference]: Without dead ends: 242603 [2025-02-05 10:49:39,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:39,454 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 221 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:39,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 812 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:49:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242603 states. [2025-02-05 10:49:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242603 to 237526. [2025-02-05 10:49:43,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237526 states, 237525 states have (on average 1.06782864961583) internal successors, (253636), 237525 states have internal predecessors, (253636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:43,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237526 states to 237526 states and 253636 transitions. [2025-02-05 10:49:43,442 INFO L78 Accepts]: Start accepts. Automaton has 237526 states and 253636 transitions. Word has length 584 [2025-02-05 10:49:43,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:43,447 INFO L471 AbstractCegarLoop]: Abstraction has 237526 states and 253636 transitions. [2025-02-05 10:49:43,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 237526 states and 253636 transitions. [2025-02-05 10:49:43,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-02-05 10:49:43,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:43,588 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:43,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-05 10:49:43,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 10:49:43,793 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:43,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 852173484, now seen corresponding path program 1 times [2025-02-05 10:49:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:43,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470662475] [2025-02-05 10:49:43,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:43,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:43,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-02-05 10:49:43,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-02-05 10:49:43,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:43,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2025-02-05 10:49:45,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470662475] [2025-02-05 10:49:45,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470662475] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:45,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460387080] [2025-02-05 10:49:45,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:45,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:45,501 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:45,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:49:45,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-02-05 10:49:45,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-02-05 10:49:45,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:45,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:45,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:49:45,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1491 backedges. 1113 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-02-05 10:49:45,921 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460387080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:45,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:45,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:49:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276945407] [2025-02-05 10:49:45,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:45,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:45,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:45,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:45,922 INFO L87 Difference]: Start difference. First operand 237526 states and 253636 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:49:47,504 INFO L93 Difference]: Finished difference Result 472018 states and 504095 transitions. [2025-02-05 10:49:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:49:47,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 592 [2025-02-05 10:49:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:49:47,783 INFO L225 Difference]: With dead ends: 472018 [2025-02-05 10:49:47,783 INFO L226 Difference]: Without dead ends: 234494 [2025-02-05 10:49:47,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:47,888 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 163 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:49:47,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 116 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:49:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234494 states. [2025-02-05 10:49:50,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234494 to 225123. [2025-02-05 10:49:50,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225123 states, 225122 states have (on average 1.060429456028287) internal successors, (238726), 225122 states have internal predecessors, (238726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:50,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225123 states to 225123 states and 238726 transitions. [2025-02-05 10:49:50,839 INFO L78 Accepts]: Start accepts. Automaton has 225123 states and 238726 transitions. Word has length 592 [2025-02-05 10:49:50,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:49:50,840 INFO L471 AbstractCegarLoop]: Abstraction has 225123 states and 238726 transitions. [2025-02-05 10:49:50,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:49:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 225123 states and 238726 transitions. [2025-02-05 10:49:50,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-02-05 10:49:50,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:49:50,953 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:49:50,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-05 10:49:51,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:51,158 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:49:51,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:49:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1112947130, now seen corresponding path program 1 times [2025-02-05 10:49:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:49:51,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701398702] [2025-02-05 10:49:51,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:51,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:49:51,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-05 10:49:51,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-05 10:49:51,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:51,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 203 proven. 6 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2025-02-05 10:49:52,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:49:52,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701398702] [2025-02-05 10:49:52,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701398702] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:49:52,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656461751] [2025-02-05 10:49:52,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:49:52,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:49:52,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:49:52,984 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:49:52,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:49:53,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-02-05 10:49:53,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-02-05 10:49:53,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:49:53,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:49:53,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 10:49:53,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:49:53,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1052 backedges. 813 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-02-05 10:49:53,320 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:49:53,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656461751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:49:53,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:49:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:49:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342478805] [2025-02-05 10:49:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:49:53,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:49:53,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:49:53,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:49:53,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:49:53,322 INFO L87 Difference]: Start difference. First operand 225123 states and 238726 transitions. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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)