./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label26.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/Problem15_label26.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 cdf2fa99034a2ce4515fc13e5b104f83251835a7a436038ebabc8d1f47f1da91 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:53:22,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:53:22,417 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:53:22,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:53:22,428 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:53:22,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:53:22,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:53:22,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:53:22,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:53:22,454 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:53:22,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:53:22,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:53:22,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:53:22,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:53:22,456 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:53:22,456 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:53:22,456 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:53:22,457 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:53:22,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:53:22,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:53:22,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:53:22,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:53:22,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:53:22,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:53:22,458 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:53:22,458 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:53:22,458 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:53:22,458 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:53:22,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:53:22,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:53:22,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:53:22,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:53:22,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:53:22,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:53:22,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:53:22,459 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:53:22,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:53:22,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:53:22,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:53:22,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:53:22,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:53:22,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:53:22,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:53:22,459 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 -> cdf2fa99034a2ce4515fc13e5b104f83251835a7a436038ebabc8d1f47f1da91 [2025-02-05 11:53:22,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:53:22,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:53:22,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:53:22,744 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:53:22,744 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:53:22,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2025-02-05 11:53:24,006 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da74f0e53/9db2878e3e8a4e0a830e6002b7cd6a3e/FLAGe10692422 [2025-02-05 11:53:24,448 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:53:24,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label26.c [2025-02-05 11:53:24,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da74f0e53/9db2878e3e8a4e0a830e6002b7cd6a3e/FLAGe10692422 [2025-02-05 11:53:24,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da74f0e53/9db2878e3e8a4e0a830e6002b7cd6a3e [2025-02-05 11:53:24,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:53:24,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:53:24,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:53:24,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:53:24,497 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:53:24,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:53:24" (1/1) ... [2025-02-05 11:53:24,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4479722 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:24, skipping insertion in model container [2025-02-05 11:53:24,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:53:24" (1/1) ... [2025-02-05 11:53:24,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:53:24,718 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/Problem15_label26.c[6541,6554] [2025-02-05 11:53:25,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:53:25,025 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:53:25,051 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/Problem15_label26.c[6541,6554] [2025-02-05 11:53:25,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:53:25,219 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:53:25,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25 WrapperNode [2025-02-05 11:53:25,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:53:25,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:53:25,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:53:25,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:53:25,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,447 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-02-05 11:53:25,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:53:25,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:53:25,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:53:25,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:53:25,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,560 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 11:53:25,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,634 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:53:25,704 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:53:25,704 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:53:25,704 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:53:25,705 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (1/1) ... [2025-02-05 11:53:25,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:53:25,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:53:25,734 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 11:53:25,741 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 11:53:25,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:53:25,761 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:53:25,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:53:25,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:53:25,822 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:53:25,824 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:53:28,348 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2025-02-05 11:53:28,476 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-02-05 11:53:28,477 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:53:28,509 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:53:28,512 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:53:28,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:53:28 BoogieIcfgContainer [2025-02-05 11:53:28,513 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:53:28,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:53:28,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:53:28,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:53:28,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:53:24" (1/3) ... [2025-02-05 11:53:28,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623c074f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:53:28, skipping insertion in model container [2025-02-05 11:53:28,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:53:25" (2/3) ... [2025-02-05 11:53:28,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@623c074f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:53:28, skipping insertion in model container [2025-02-05 11:53:28,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:53:28" (3/3) ... [2025-02-05 11:53:28,523 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label26.c [2025-02-05 11:53:28,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:53:28,539 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label26.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:53:28,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:53:28,633 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;@77710d99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:53:28,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:53:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 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 11:53:28,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 11:53:28,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:28,651 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] [2025-02-05 11:53:28,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:28,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1397927119, now seen corresponding path program 1 times [2025-02-05 11:53:28,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:28,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144599376] [2025-02-05 11:53:28,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:28,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 11:53:28,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 11:53:28,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:28,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:29,057 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 11:53:29,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:29,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144599376] [2025-02-05 11:53:29,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144599376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:29,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:29,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:53:29,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641909511] [2025-02-05 11:53:29,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:29,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:29,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:29,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:29,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:29,083 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 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 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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 11:53:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:30,982 INFO L93 Difference]: Finished difference Result 1191 states and 2154 transitions. [2025-02-05 11:53:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:30,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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 53 [2025-02-05 11:53:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:30,995 INFO L225 Difference]: With dead ends: 1191 [2025-02-05 11:53:30,995 INFO L226 Difference]: Without dead ends: 688 [2025-02-05 11:53:30,999 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 11:53:31,001 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 318 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:31,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 229 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 11:53:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-02-05 11:53:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2025-02-05 11:53:31,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 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 11:53:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions. [2025-02-05 11:53:31,079 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 53 [2025-02-05 11:53:31,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:31,080 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions. [2025-02-05 11:53:31,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 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 11:53:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions. [2025-02-05 11:53:31,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-05 11:53:31,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:31,085 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, 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 11:53:31,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:53:31,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:31,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:31,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1455318446, now seen corresponding path program 1 times [2025-02-05 11:53:31,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:31,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843508442] [2025-02-05 11:53:31,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:31,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:31,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-05 11:53:31,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-05 11:53:31,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:31,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:53:31,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:31,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843508442] [2025-02-05 11:53:31,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843508442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:31,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:31,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:53:31,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478210896] [2025-02-05 11:53:31,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:31,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:31,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:31,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:31,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:31,375 INFO L87 Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 11:53:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:32,765 INFO L93 Difference]: Finished difference Result 1964 states and 3171 transitions. [2025-02-05 11:53:32,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:32,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2025-02-05 11:53:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:32,770 INFO L225 Difference]: With dead ends: 1964 [2025-02-05 11:53:32,770 INFO L226 Difference]: Without dead ends: 1286 [2025-02-05 11:53:32,772 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 11:53:32,773 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:32,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 361 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:53:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2025-02-05 11:53:32,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281. [2025-02-05 11:53:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.3953125) internal successors, (1786), 1280 states have internal predecessors, (1786), 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 11:53:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions. [2025-02-05 11:53:32,812 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 121 [2025-02-05 11:53:32,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:32,812 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions. [2025-02-05 11:53:32,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 11:53:32,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions. [2025-02-05 11:53:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-05 11:53:32,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:32,816 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, 1, 1, 1, 1, 1, 1, 1, 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 11:53:32,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:53:32,817 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:32,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1108927334, now seen corresponding path program 1 times [2025-02-05 11:53:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:32,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337523900] [2025-02-05 11:53:32,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:32,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-05 11:53:32,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-05 11:53:32,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:32,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:53:33,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:33,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337523900] [2025-02-05 11:53:33,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337523900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:33,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:33,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:53:33,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937427827] [2025-02-05 11:53:33,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:33,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:33,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:33,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:33,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:33,290 INFO L87 Difference]: Start difference. First operand 1281 states and 1786 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 11:53:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:34,886 INFO L93 Difference]: Finished difference Result 2859 states and 3905 transitions. [2025-02-05 11:53:34,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:34,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 129 [2025-02-05 11:53:34,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:34,893 INFO L225 Difference]: With dead ends: 2859 [2025-02-05 11:53:34,893 INFO L226 Difference]: Without dead ends: 1580 [2025-02-05 11:53:34,894 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 11:53:34,895 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:34,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 11:53:34,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-02-05 11:53:34,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2025-02-05 11:53:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.3242558581380621) internal successors, (2091), 1579 states have internal predecessors, (2091), 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 11:53:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2091 transitions. [2025-02-05 11:53:34,928 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2091 transitions. Word has length 129 [2025-02-05 11:53:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:34,930 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2091 transitions. [2025-02-05 11:53:34,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 11:53:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2091 transitions. [2025-02-05 11:53:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 11:53:34,934 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:34,935 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:53:34,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:53:34,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:34,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2045632556, now seen corresponding path program 1 times [2025-02-05 11:53:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:34,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685249350] [2025-02-05 11:53:34,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:34,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 11:53:34,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 11:53:34,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:34,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 11:53:35,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685249350] [2025-02-05 11:53:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685249350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:35,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:35,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:53:35,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980059816] [2025-02-05 11:53:35,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:35,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:35,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:35,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:35,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:35,205 INFO L87 Difference]: Start difference. First operand 1580 states and 2091 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 11:53:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:36,604 INFO L93 Difference]: Finished difference Result 4065 states and 5551 transitions. [2025-02-05 11:53:36,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:36,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 220 [2025-02-05 11:53:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:36,616 INFO L225 Difference]: With dead ends: 4065 [2025-02-05 11:53:36,617 INFO L226 Difference]: Without dead ends: 2786 [2025-02-05 11:53:36,619 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 11:53:36,621 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 275 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:36,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:53:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2025-02-05 11:53:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2786. [2025-02-05 11:53:36,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2785 states have (on average 1.2204667863554757) internal successors, (3399), 2785 states have internal predecessors, (3399), 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 11:53:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 3399 transitions. [2025-02-05 11:53:36,675 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 3399 transitions. Word has length 220 [2025-02-05 11:53:36,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:36,676 INFO L471 AbstractCegarLoop]: Abstraction has 2786 states and 3399 transitions. [2025-02-05 11:53:36,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 11:53:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 3399 transitions. [2025-02-05 11:53:36,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-05 11:53:36,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:36,680 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:53:36,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:53:36,680 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:36,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:36,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1707990554, now seen corresponding path program 1 times [2025-02-05 11:53:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:36,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032444459] [2025-02-05 11:53:36,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:36,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:36,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 11:53:36,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 11:53:36,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:36,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-02-05 11:53:36,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:36,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032444459] [2025-02-05 11:53:36,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032444459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:36,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:36,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:53:36,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516608602] [2025-02-05 11:53:36,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:36,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:36,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:36,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:36,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:36,976 INFO L87 Difference]: Start difference. First operand 2786 states and 3399 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 11:53:38,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:38,574 INFO L93 Difference]: Finished difference Result 6472 states and 8164 transitions. [2025-02-05 11:53:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:38,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 226 [2025-02-05 11:53:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:38,589 INFO L225 Difference]: With dead ends: 6472 [2025-02-05 11:53:38,589 INFO L226 Difference]: Without dead ends: 3987 [2025-02-05 11:53:38,592 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 11:53:38,593 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 220 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:38,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 363 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:53:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2025-02-05 11:53:38,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3686. [2025-02-05 11:53:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3685 states have (on average 1.1959294436906378) internal successors, (4407), 3685 states have internal predecessors, (4407), 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 11:53:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4407 transitions. [2025-02-05 11:53:38,655 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4407 transitions. Word has length 226 [2025-02-05 11:53:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:38,655 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4407 transitions. [2025-02-05 11:53:38,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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 11:53:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4407 transitions. [2025-02-05 11:53:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-02-05 11:53:38,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:38,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:38,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:53:38,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:38,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:38,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2026317815, now seen corresponding path program 1 times [2025-02-05 11:53:38,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:38,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186424229] [2025-02-05 11:53:38,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:38,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-02-05 11:53:38,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-02-05 11:53:38,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:38,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:38,986 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 11:53:38,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:38,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186424229] [2025-02-05 11:53:38,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186424229] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:38,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:38,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:53:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325037184] [2025-02-05 11:53:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:38,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:38,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:38,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:38,993 INFO L87 Difference]: Start difference. First operand 3686 states and 4407 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 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 11:53:40,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:40,477 INFO L93 Difference]: Finished difference Result 9471 states and 11465 transitions. [2025-02-05 11:53:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:40,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 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 335 [2025-02-05 11:53:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:40,495 INFO L225 Difference]: With dead ends: 9471 [2025-02-05 11:53:40,495 INFO L226 Difference]: Without dead ends: 6086 [2025-02-05 11:53:40,500 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 11:53:40,501 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 31 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:40,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 325 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:53:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6086 states. [2025-02-05 11:53:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6086 to 5485. [2025-02-05 11:53:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5484 states have (on average 1.1692195477753464) internal successors, (6412), 5484 states have internal predecessors, (6412), 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 11:53:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 6412 transitions. [2025-02-05 11:53:40,592 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 6412 transitions. Word has length 335 [2025-02-05 11:53:40,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:40,592 INFO L471 AbstractCegarLoop]: Abstraction has 5485 states and 6412 transitions. [2025-02-05 11:53:40,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 2 states have internal predecessors, (286), 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 11:53:40,593 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 6412 transitions. [2025-02-05 11:53:40,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-02-05 11:53:40,600 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:40,601 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:40,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:53:40,601 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:40,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:40,601 INFO L85 PathProgramCache]: Analyzing trace with hash -179911007, now seen corresponding path program 1 times [2025-02-05 11:53:40,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:40,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809442020] [2025-02-05 11:53:40,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:40,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:40,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-02-05 11:53:40,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-02-05 11:53:40,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:40,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 11:53:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:40,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809442020] [2025-02-05 11:53:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809442020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:40,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:40,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:53:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968246549] [2025-02-05 11:53:40,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:40,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:40,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:40,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:40,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:40,931 INFO L87 Difference]: Start difference. First operand 5485 states and 6412 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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 11:53:42,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:42,520 INFO L93 Difference]: Finished difference Result 12470 states and 14901 transitions. [2025-02-05 11:53:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:42,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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 340 [2025-02-05 11:53:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:42,538 INFO L225 Difference]: With dead ends: 12470 [2025-02-05 11:53:42,539 INFO L226 Difference]: Without dead ends: 7286 [2025-02-05 11:53:42,546 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 11:53:42,547 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 274 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:42,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 639 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:53:42,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2025-02-05 11:53:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 7284. [2025-02-05 11:53:42,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.148427845667994) internal successors, (8364), 7283 states have internal predecessors, (8364), 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 11:53:42,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8364 transitions. [2025-02-05 11:53:42,661 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8364 transitions. Word has length 340 [2025-02-05 11:53:42,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:42,662 INFO L471 AbstractCegarLoop]: Abstraction has 7284 states and 8364 transitions. [2025-02-05 11:53:42,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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 11:53:42,663 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8364 transitions. [2025-02-05 11:53:42,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-02-05 11:53:42,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:42,669 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:42,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:53:42,671 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:42,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash 530031907, now seen corresponding path program 1 times [2025-02-05 11:53:42,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:42,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732283770] [2025-02-05 11:53:42,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:42,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:42,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-05 11:53:42,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-05 11:53:42,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:42,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:53:43,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:43,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732283770] [2025-02-05 11:53:43,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732283770] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:43,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:43,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:53:43,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139942612] [2025-02-05 11:53:43,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:43,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:43,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:43,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:43,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:43,016 INFO L87 Difference]: Start difference. First operand 7284 states and 8364 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 11:53:44,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:44,536 INFO L93 Difference]: Finished difference Result 16069 states and 18808 transitions. [2025-02-05 11:53:44,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:44,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 416 [2025-02-05 11:53:44,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:44,561 INFO L225 Difference]: With dead ends: 16069 [2025-02-05 11:53:44,561 INFO L226 Difference]: Without dead ends: 9086 [2025-02-05 11:53:44,565 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 11:53:44,565 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 248 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:44,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 622 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:53:44,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2025-02-05 11:53:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8780. [2025-02-05 11:53:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8780 states, 8779 states have (on average 1.1346394805786537) internal successors, (9961), 8779 states have internal predecessors, (9961), 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 11:53:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8780 states to 8780 states and 9961 transitions. [2025-02-05 11:53:44,697 INFO L78 Accepts]: Start accepts. Automaton has 8780 states and 9961 transitions. Word has length 416 [2025-02-05 11:53:44,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:44,698 INFO L471 AbstractCegarLoop]: Abstraction has 8780 states and 9961 transitions. [2025-02-05 11:53:44,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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 11:53:44,698 INFO L276 IsEmpty]: Start isEmpty. Operand 8780 states and 9961 transitions. [2025-02-05 11:53:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-02-05 11:53:44,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:44,711 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:44,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:53:44,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:44,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:44,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1057394097, now seen corresponding path program 1 times [2025-02-05 11:53:44,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:44,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569960707] [2025-02-05 11:53:44,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:44,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:44,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-02-05 11:53:44,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-02-05 11:53:44,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:44,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:45,031 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-02-05 11:53:45,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:45,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569960707] [2025-02-05 11:53:45,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569960707] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:45,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:45,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:53:45,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452092994] [2025-02-05 11:53:45,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:45,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:45,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:45,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:45,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:45,035 INFO L87 Difference]: Start difference. First operand 8780 states and 9961 transitions. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 11:53:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:46,468 INFO L93 Difference]: Finished difference Result 20548 states and 23478 transitions. [2025-02-05 11:53:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:46,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 426 [2025-02-05 11:53:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:46,491 INFO L225 Difference]: With dead ends: 20548 [2025-02-05 11:53:46,491 INFO L226 Difference]: Without dead ends: 12069 [2025-02-05 11:53:46,500 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 11:53:46,501 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 261 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:46,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 316 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:53:46,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12069 states. [2025-02-05 11:53:46,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12069 to 7877. [2025-02-05 11:53:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7877 states, 7876 states have (on average 1.1444895886236668) internal successors, (9014), 7876 states have internal predecessors, (9014), 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 11:53:46,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7877 states to 7877 states and 9014 transitions. [2025-02-05 11:53:46,643 INFO L78 Accepts]: Start accepts. Automaton has 7877 states and 9014 transitions. Word has length 426 [2025-02-05 11:53:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:46,644 INFO L471 AbstractCegarLoop]: Abstraction has 7877 states and 9014 transitions. [2025-02-05 11:53:46,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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 11:53:46,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7877 states and 9014 transitions. [2025-02-05 11:53:46,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-02-05 11:53:46,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:46,653 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:46,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:53:46,653 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:46,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:46,658 INFO L85 PathProgramCache]: Analyzing trace with hash 697051817, now seen corresponding path program 1 times [2025-02-05 11:53:46,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:46,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435625827] [2025-02-05 11:53:46,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:46,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:46,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-02-05 11:53:46,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-02-05 11:53:46,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:46,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2025-02-05 11:53:46,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:46,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435625827] [2025-02-05 11:53:46,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435625827] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:46,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:46,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:53:46,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570379910] [2025-02-05 11:53:46,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:46,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:46,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:46,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:46,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:46,970 INFO L87 Difference]: Start difference. First operand 7877 states and 9014 transitions. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 11:53:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:48,174 INFO L93 Difference]: Finished difference Result 17844 states and 20678 transitions. [2025-02-05 11:53:48,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:48,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 517 [2025-02-05 11:53:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:48,195 INFO L225 Difference]: With dead ends: 17844 [2025-02-05 11:53:48,195 INFO L226 Difference]: Without dead ends: 10268 [2025-02-05 11:53:48,202 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 11:53:48,203 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 362 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:48,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 446 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:53:48,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10268 states. [2025-02-05 11:53:48,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10268 to 10268. [2025-02-05 11:53:48,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10268 states, 10267 states have (on average 1.146878348105581) internal successors, (11775), 10267 states have internal predecessors, (11775), 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 11:53:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10268 states to 10268 states and 11775 transitions. [2025-02-05 11:53:48,317 INFO L78 Accepts]: Start accepts. Automaton has 10268 states and 11775 transitions. Word has length 517 [2025-02-05 11:53:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:48,317 INFO L471 AbstractCegarLoop]: Abstraction has 10268 states and 11775 transitions. [2025-02-05 11:53:48,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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 11:53:48,318 INFO L276 IsEmpty]: Start isEmpty. Operand 10268 states and 11775 transitions. [2025-02-05 11:53:48,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-05 11:53:48,323 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:48,323 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 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] [2025-02-05 11:53:48,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:53:48,324 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:48,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:48,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1594619597, now seen corresponding path program 1 times [2025-02-05 11:53:48,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:48,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646356027] [2025-02-05 11:53:48,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:48,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:48,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 11:53:48,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 11:53:48,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:48,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-02-05 11:53:48,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:48,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646356027] [2025-02-05 11:53:48,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646356027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:48,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:53:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:53:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265443355] [2025-02-05 11:53:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:48,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:48,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:48,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:53:48,767 INFO L87 Difference]: Start difference. First operand 10268 states and 11775 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 11:53:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:50,181 INFO L93 Difference]: Finished difference Result 25033 states and 28938 transitions. [2025-02-05 11:53:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:50,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 541 [2025-02-05 11:53:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:50,208 INFO L225 Difference]: With dead ends: 25033 [2025-02-05 11:53:50,208 INFO L226 Difference]: Without dead ends: 15066 [2025-02-05 11:53:50,219 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 11:53:50,219 INFO L435 NwaCegarLoop]: 589 mSDtfsCounter, 248 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:50,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:53:50,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15066 states. [2025-02-05 11:53:50,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15066 to 15055. [2025-02-05 11:53:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15055 states, 15054 states have (on average 1.1306629467251228) internal successors, (17021), 15054 states have internal predecessors, (17021), 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 11:53:50,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 17021 transitions. [2025-02-05 11:53:50,407 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 17021 transitions. Word has length 541 [2025-02-05 11:53:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:50,408 INFO L471 AbstractCegarLoop]: Abstraction has 15055 states and 17021 transitions. [2025-02-05 11:53:50,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 11:53:50,408 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 17021 transitions. [2025-02-05 11:53:50,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2025-02-05 11:53:50,416 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:50,417 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:53:50,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:53:50,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:50,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash -934586077, now seen corresponding path program 1 times [2025-02-05 11:53:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:50,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621586204] [2025-02-05 11:53:50,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:50,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:50,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-02-05 11:53:50,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-02-05 11:53:50,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:50,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 153 proven. 317 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-02-05 11:53:51,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:51,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621586204] [2025-02-05 11:53:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621586204] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:53:51,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144383872] [2025-02-05 11:53:51,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:51,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:53:51,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:53:51,542 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 11:53:51,543 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 11:53:51,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 595 statements into 1 equivalence classes. [2025-02-05 11:53:51,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 595 of 595 statements. [2025-02-05 11:53:51,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:51,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:51,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:53:51,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:53:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 711 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-02-05 11:53:51,899 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:53:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144383872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:53:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:53:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:53:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230981121] [2025-02-05 11:53:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:53:51,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:53:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:51,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:53:51,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:53:51,902 INFO L87 Difference]: Start difference. First operand 15055 states and 17021 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 11:53:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:53:53,474 INFO L93 Difference]: Finished difference Result 29506 states and 33400 transitions. [2025-02-05 11:53:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:53:53,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 595 [2025-02-05 11:53:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:53:53,495 INFO L225 Difference]: With dead ends: 29506 [2025-02-05 11:53:53,496 INFO L226 Difference]: Without dead ends: 14752 [2025-02-05 11:53:53,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 595 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:53:53,511 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 278 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:53:53,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 606 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 11:53:53,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14752 states. [2025-02-05 11:53:53,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14752 to 13854. [2025-02-05 11:53:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13854 states, 13853 states have (on average 1.081642965422652) internal successors, (14984), 13853 states have internal predecessors, (14984), 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 11:53:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13854 states to 13854 states and 14984 transitions. [2025-02-05 11:53:53,665 INFO L78 Accepts]: Start accepts. Automaton has 13854 states and 14984 transitions. Word has length 595 [2025-02-05 11:53:53,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:53:53,666 INFO L471 AbstractCegarLoop]: Abstraction has 13854 states and 14984 transitions. [2025-02-05 11:53:53,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 11:53:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 13854 states and 14984 transitions. [2025-02-05 11:53:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2025-02-05 11:53:53,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:53:53,675 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 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] [2025-02-05 11:53:53,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:53:53,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 11:53:53,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:53:53,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:53:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash -542838215, now seen corresponding path program 1 times [2025-02-05 11:53:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:53:53,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349411799] [2025-02-05 11:53:53,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:53,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:53:53,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-02-05 11:53:53,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-02-05 11:53:53,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:53,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-02-05 11:53:54,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:53:54,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349411799] [2025-02-05 11:53:54,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349411799] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:53:54,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459238499] [2025-02-05 11:53:54,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:53:54,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:53:54,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:53:54,461 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 11:53:54,462 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 11:53:54,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes. [2025-02-05 11:53:54,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements. [2025-02-05 11:53:54,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:53:54,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:53:54,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 11:53:54,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:53:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-02-05 11:53:55,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:53:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 598 proven. 39 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-02-05 11:53:56,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459238499] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:53:56,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:53:56,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-02-05 11:53:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335931581] [2025-02-05 11:53:56,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:53:56,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 11:53:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:53:56,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 11:53:56,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:53:56,220 INFO L87 Difference]: Start difference. First operand 13854 states and 14984 transitions. Second operand has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 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 11:54:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:00,625 INFO L93 Difference]: Finished difference Result 36040 states and 38971 transitions. [2025-02-05 11:54:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 11:54:00,626 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 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 608 [2025-02-05 11:54:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:00,656 INFO L225 Difference]: With dead ends: 36040 [2025-02-05 11:54:00,656 INFO L226 Difference]: Without dead ends: 16546 [2025-02-05 11:54:00,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1211 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-02-05 11:54:00,674 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 3519 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 4669 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3519 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 5440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 4669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:00,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3519 Valid, 192 Invalid, 5440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 4669 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 11:54:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16546 states. [2025-02-05 11:54:00,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16546 to 12656. [2025-02-05 11:54:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12656 states, 12655 states have (on average 1.0378506519162387) internal successors, (13134), 12655 states have internal predecessors, (13134), 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 11:54:00,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12656 states to 12656 states and 13134 transitions. [2025-02-05 11:54:00,899 INFO L78 Accepts]: Start accepts. Automaton has 12656 states and 13134 transitions. Word has length 608 [2025-02-05 11:54:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:00,899 INFO L471 AbstractCegarLoop]: Abstraction has 12656 states and 13134 transitions. [2025-02-05 11:54:00,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 80.77777777777777) internal successors, (727), 8 states have internal predecessors, (727), 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 11:54:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 12656 states and 13134 transitions. [2025-02-05 11:54:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2025-02-05 11:54:00,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:00,909 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:00,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:54:01,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:01,110 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:01,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:01,111 INFO L85 PathProgramCache]: Analyzing trace with hash -362622361, now seen corresponding path program 1 times [2025-02-05 11:54:01,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:01,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633389300] [2025-02-05 11:54:01,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:01,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:01,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 678 statements into 1 equivalence classes. [2025-02-05 11:54:01,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 678 of 678 statements. [2025-02-05 11:54:01,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:01,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2025-02-05 11:54:01,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633389300] [2025-02-05 11:54:01,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633389300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:01,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:01,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:01,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303451661] [2025-02-05 11:54:01,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:01,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:01,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:01,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:01,393 INFO L87 Difference]: Start difference. First operand 12656 states and 13134 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 11:54:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:02,201 INFO L93 Difference]: Finished difference Result 27997 states and 29099 transitions. [2025-02-05 11:54:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 678 [2025-02-05 11:54:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:02,220 INFO L225 Difference]: With dead ends: 27997 [2025-02-05 11:54:02,221 INFO L226 Difference]: Without dead ends: 15343 [2025-02-05 11:54:02,230 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 11:54:02,231 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 277 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:02,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 192 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:54:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15343 states. [2025-02-05 11:54:02,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15343 to 14744. [2025-02-05 11:54:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14744 states, 14743 states have (on average 1.033643084853829) internal successors, (15239), 14743 states have internal predecessors, (15239), 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 11:54:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14744 states to 14744 states and 15239 transitions. [2025-02-05 11:54:02,422 INFO L78 Accepts]: Start accepts. Automaton has 14744 states and 15239 transitions. Word has length 678 [2025-02-05 11:54:02,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:02,423 INFO L471 AbstractCegarLoop]: Abstraction has 14744 states and 15239 transitions. [2025-02-05 11:54:02,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 11:54:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 14744 states and 15239 transitions. [2025-02-05 11:54:02,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-02-05 11:54:02,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:02,432 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:02,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:54:02,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:02,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash -736605304, now seen corresponding path program 1 times [2025-02-05 11:54:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:02,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223783974] [2025-02-05 11:54:02,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:02,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:02,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-02-05 11:54:02,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-02-05 11:54:02,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:02,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:03,072 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 596 proven. 190 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-02-05 11:54:03,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:03,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223783974] [2025-02-05 11:54:03,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223783974] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:03,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543625761] [2025-02-05 11:54:03,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:03,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:03,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:54:03,075 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 11:54:03,078 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 11:54:03,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-02-05 11:54:03,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-02-05 11:54:03,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:03,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:03,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:54:03,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:54:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-02-05 11:54:03,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:54:03,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543625761] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:03,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:54:03,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:54:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033699143] [2025-02-05 11:54:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:03,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:03,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:03,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:54:03,651 INFO L87 Difference]: Start difference. First operand 14744 states and 15239 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 11:54:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:04,656 INFO L93 Difference]: Finished difference Result 31296 states and 32405 transitions. [2025-02-05 11:54:04,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:04,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 685 [2025-02-05 11:54:04,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:04,678 INFO L225 Difference]: With dead ends: 31296 [2025-02-05 11:54:04,678 INFO L226 Difference]: Without dead ends: 16554 [2025-02-05 11:54:04,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 684 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:54:04,691 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 298 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:04,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 126 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:54:04,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16554 states. [2025-02-05 11:54:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16554 to 14444. [2025-02-05 11:54:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14444 states, 14443 states have (on average 1.0335802811050336) internal successors, (14928), 14443 states have internal predecessors, (14928), 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 11:54:04,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 14928 transitions. [2025-02-05 11:54:04,916 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 14928 transitions. Word has length 685 [2025-02-05 11:54:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:04,917 INFO L471 AbstractCegarLoop]: Abstraction has 14444 states and 14928 transitions. [2025-02-05 11:54:04,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 11:54:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 14928 transitions. [2025-02-05 11:54:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-02-05 11:54:04,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:04,930 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:04,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 11:54:05,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:05,131 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:05,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash -299701220, now seen corresponding path program 1 times [2025-02-05 11:54:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:05,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175789194] [2025-02-05 11:54:05,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:05,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:05,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-02-05 11:54:05,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-02-05 11:54:05,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:05,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-02-05 11:54:05,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:05,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175789194] [2025-02-05 11:54:05,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175789194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:05,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:05,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:54:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75471908] [2025-02-05 11:54:05,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:05,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:54:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:05,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:54:05,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:54:05,791 INFO L87 Difference]: Start difference. First operand 14444 states and 14928 transitions. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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 11:54:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:07,327 INFO L93 Difference]: Finished difference Result 31888 states and 33032 transitions. [2025-02-05 11:54:07,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:54:07,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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 711 [2025-02-05 11:54:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:07,343 INFO L225 Difference]: With dead ends: 31888 [2025-02-05 11:54:07,343 INFO L226 Difference]: Without dead ends: 17745 [2025-02-05 11:54:07,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:54:07,352 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 656 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1819 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:07,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 450 Invalid, 1972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1819 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:54:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17745 states. [2025-02-05 11:54:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17745 to 16848. [2025-02-05 11:54:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16848 states, 16847 states have (on average 1.0306285985635424) internal successors, (17363), 16847 states have internal predecessors, (17363), 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 11:54:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16848 states to 16848 states and 17363 transitions. [2025-02-05 11:54:07,510 INFO L78 Accepts]: Start accepts. Automaton has 16848 states and 17363 transitions. Word has length 711 [2025-02-05 11:54:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:07,510 INFO L471 AbstractCegarLoop]: Abstraction has 16848 states and 17363 transitions. [2025-02-05 11:54:07,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 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 11:54:07,511 INFO L276 IsEmpty]: Start isEmpty. Operand 16848 states and 17363 transitions. [2025-02-05 11:54:07,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2025-02-05 11:54:07,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:07,521 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:07,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 11:54:07,521 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:07,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:07,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1013736812, now seen corresponding path program 1 times [2025-02-05 11:54:07,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:07,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762029964] [2025-02-05 11:54:07,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:07,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:07,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-02-05 11:54:07,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-02-05 11:54:07,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:07,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1007 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-02-05 11:54:07,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:07,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762029964] [2025-02-05 11:54:07,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762029964] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:07,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:07,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558809691] [2025-02-05 11:54:07,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:07,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:07,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:07,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:07,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:07,867 INFO L87 Difference]: Start difference. First operand 16848 states and 17363 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 11:54:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:08,604 INFO L93 Difference]: Finished difference Result 33692 states and 34726 transitions. [2025-02-05 11:54:08,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:08,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 796 [2025-02-05 11:54:08,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:08,619 INFO L225 Difference]: With dead ends: 33692 [2025-02-05 11:54:08,619 INFO L226 Difference]: Without dead ends: 17145 [2025-02-05 11:54:08,628 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 11:54:08,629 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 436 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:08,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 68 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:54:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17145 states. [2025-02-05 11:54:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17145 to 16846. [2025-02-05 11:54:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16846 states, 16845 states have (on average 1.0305135054912438) internal successors, (17359), 16845 states have internal predecessors, (17359), 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 11:54:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16846 states to 16846 states and 17359 transitions. [2025-02-05 11:54:08,830 INFO L78 Accepts]: Start accepts. Automaton has 16846 states and 17359 transitions. Word has length 796 [2025-02-05 11:54:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:08,831 INFO L471 AbstractCegarLoop]: Abstraction has 16846 states and 17359 transitions. [2025-02-05 11:54:08,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 11:54:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 16846 states and 17359 transitions. [2025-02-05 11:54:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2025-02-05 11:54:08,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:08,843 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:08,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:54:08,843 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:08,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash 319922832, now seen corresponding path program 1 times [2025-02-05 11:54:08,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:08,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648368114] [2025-02-05 11:54:08,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:08,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:08,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-02-05 11:54:08,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-02-05 11:54:08,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:08,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 802 proven. 51 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2025-02-05 11:54:09,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648368114] [2025-02-05 11:54:09,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648368114] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:09,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136154262] [2025-02-05 11:54:09,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:54:09,657 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 11:54:09,658 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 11:54:09,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 838 statements into 1 equivalence classes. [2025-02-05 11:54:09,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 838 of 838 statements. [2025-02-05 11:54:09,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:09,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:09,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:54:09,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:54:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2025-02-05 11:54:11,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:54:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136154262] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:11,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:54:11,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:54:11,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211979728] [2025-02-05 11:54:11,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:11,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:54:11,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:11,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:54:11,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:54:11,077 INFO L87 Difference]: Start difference. First operand 16846 states and 17359 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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 11:54:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:12,424 INFO L93 Difference]: Finished difference Result 39687 states and 40957 transitions. [2025-02-05 11:54:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:54:12,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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 838 [2025-02-05 11:54:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:12,449 INFO L225 Difference]: With dead ends: 39687 [2025-02-05 11:54:12,450 INFO L226 Difference]: Without dead ends: 23142 [2025-02-05 11:54:12,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 837 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:54:12,459 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 311 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:12,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 117 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 11:54:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23142 states. [2025-02-05 11:54:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23142 to 19541. [2025-02-05 11:54:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19541 states, 19540 states have (on average 1.028300921187308) internal successors, (20093), 19540 states have internal predecessors, (20093), 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 11:54:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19541 states to 19541 states and 20093 transitions. [2025-02-05 11:54:12,684 INFO L78 Accepts]: Start accepts. Automaton has 19541 states and 20093 transitions. Word has length 838 [2025-02-05 11:54:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:12,685 INFO L471 AbstractCegarLoop]: Abstraction has 19541 states and 20093 transitions. [2025-02-05 11:54:12,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 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 11:54:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 19541 states and 20093 transitions. [2025-02-05 11:54:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2025-02-05 11:54:12,710 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:12,710 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:54:12,716 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 11:54:12,910 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,SelfDestructingSolverStorable17 [2025-02-05 11:54:12,911 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:12,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:12,911 INFO L85 PathProgramCache]: Analyzing trace with hash -286311481, now seen corresponding path program 1 times [2025-02-05 11:54:12,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:12,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048769128] [2025-02-05 11:54:12,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:12,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:13,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 920 statements into 1 equivalence classes. [2025-02-05 11:54:13,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 920 of 920 statements. [2025-02-05 11:54:13,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:13,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:13,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 793 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2025-02-05 11:54:13,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:13,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048769128] [2025-02-05 11:54:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048769128] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:13,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:13,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:54:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412695873] [2025-02-05 11:54:13,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:13,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:54:13,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:13,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:54:13,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:54:13,498 INFO L87 Difference]: Start difference. First operand 19541 states and 20093 transitions. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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 11:54:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:14,719 INFO L93 Difference]: Finished difference Result 41176 states and 42431 transitions. [2025-02-05 11:54:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:54:14,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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 920 [2025-02-05 11:54:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:14,741 INFO L225 Difference]: With dead ends: 41176 [2025-02-05 11:54:14,741 INFO L226 Difference]: Without dead ends: 24332 [2025-02-05 11:54:14,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:54:14,752 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 514 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:14,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 137 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:54:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24332 states. [2025-02-05 11:54:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24332 to 23131. [2025-02-05 11:54:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23131 states, 23130 states have (on average 1.028880242109814) internal successors, (23798), 23130 states have internal predecessors, (23798), 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 11:54:14,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23131 states to 23131 states and 23798 transitions. [2025-02-05 11:54:14,927 INFO L78 Accepts]: Start accepts. Automaton has 23131 states and 23798 transitions. Word has length 920 [2025-02-05 11:54:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:14,927 INFO L471 AbstractCegarLoop]: Abstraction has 23131 states and 23798 transitions. [2025-02-05 11:54:14,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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 11:54:14,928 INFO L276 IsEmpty]: Start isEmpty. Operand 23131 states and 23798 transitions. [2025-02-05 11:54:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 926 [2025-02-05 11:54:14,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:14,944 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 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 11:54:14,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:54:14,944 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:14,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:14,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2067912909, now seen corresponding path program 1 times [2025-02-05 11:54:14,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:14,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898588414] [2025-02-05 11:54:14,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:14,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:15,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 925 statements into 1 equivalence classes. [2025-02-05 11:54:15,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 925 of 925 statements. [2025-02-05 11:54:15,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:15,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 742 proven. 0 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2025-02-05 11:54:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:15,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898588414] [2025-02-05 11:54:15,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898588414] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:15,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:15,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:54:15,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43613113] [2025-02-05 11:54:15,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:15,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:15,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:15,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:15,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:54:15,407 INFO L87 Difference]: Start difference. First operand 23131 states and 23798 transitions. Second operand has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 11:54:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:16,375 INFO L93 Difference]: Finished difference Result 46851 states and 48300 transitions. [2025-02-05 11:54:16,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:16,376 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 925 [2025-02-05 11:54:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:16,397 INFO L225 Difference]: With dead ends: 46851 [2025-02-05 11:54:16,397 INFO L226 Difference]: Without dead ends: 26417 [2025-02-05 11:54:16,410 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 11:54:16,411 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 312 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:16,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 507 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:54:16,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26417 states. [2025-02-05 11:54:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26417 to 22229. [2025-02-05 11:54:16,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22229 states, 22228 states have (on average 1.0279377361885909) internal successors, (22849), 22228 states have internal predecessors, (22849), 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 11:54:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22229 states to 22229 states and 22849 transitions. [2025-02-05 11:54:16,590 INFO L78 Accepts]: Start accepts. Automaton has 22229 states and 22849 transitions. Word has length 925 [2025-02-05 11:54:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:16,590 INFO L471 AbstractCegarLoop]: Abstraction has 22229 states and 22849 transitions. [2025-02-05 11:54:16,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 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 11:54:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 22229 states and 22849 transitions. [2025-02-05 11:54:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2025-02-05 11:54:16,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:16,609 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:16,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 11:54:16,609 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:16,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash 477878608, now seen corresponding path program 1 times [2025-02-05 11:54:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:16,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59095786] [2025-02-05 11:54:16,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:16,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-02-05 11:54:16,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-02-05 11:54:16,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:16,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:17,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1370 proven. 51 refuted. 0 times theorem prover too weak. 829 trivial. 0 not checked. [2025-02-05 11:54:17,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:17,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59095786] [2025-02-05 11:54:17,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59095786] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:17,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641556490] [2025-02-05 11:54:17,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:17,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:17,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:54:17,727 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 11:54:17,728 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 11:54:17,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1077 statements into 1 equivalence classes. [2025-02-05 11:54:17,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1077 of 1077 statements. [2025-02-05 11:54:17,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:17,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:17,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:54:17,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:54:19,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 1520 proven. 266 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2025-02-05 11:54:19,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:54:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 955 proven. 0 refuted. 0 times theorem prover too weak. 1295 trivial. 0 not checked. [2025-02-05 11:54:20,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641556490] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:54:20,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2025-02-05 11:54:20,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353572455] [2025-02-05 11:54:20,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:20,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:20,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:20,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:20,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:54:20,200 INFO L87 Difference]: Start difference. First operand 22229 states and 22849 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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 11:54:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:20,859 INFO L93 Difference]: Finished difference Result 35433 states and 36424 transitions. [2025-02-05 11:54:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:20,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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 1077 [2025-02-05 11:54:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:20,873 INFO L225 Difference]: With dead ends: 35433 [2025-02-05 11:54:20,873 INFO L226 Difference]: Without dead ends: 15602 [2025-02-05 11:54:20,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2157 GetRequests, 2151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 11:54:20,885 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 193 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:20,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 359 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:54:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15602 states. [2025-02-05 11:54:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15602 to 14107. [2025-02-05 11:54:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14107 states, 14106 states have (on average 1.0194952502481214) internal successors, (14381), 14106 states have internal predecessors, (14381), 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 11:54:21,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14107 states to 14107 states and 14381 transitions. [2025-02-05 11:54:21,046 INFO L78 Accepts]: Start accepts. Automaton has 14107 states and 14381 transitions. Word has length 1077 [2025-02-05 11:54:21,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:21,046 INFO L471 AbstractCegarLoop]: Abstraction has 14107 states and 14381 transitions. [2025-02-05 11:54:21,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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 11:54:21,046 INFO L276 IsEmpty]: Start isEmpty. Operand 14107 states and 14381 transitions. [2025-02-05 11:54:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1090 [2025-02-05 11:54:21,064 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:21,064 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 5, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:54:21,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 11:54:21,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:21,265 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:21,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:21,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1829367132, now seen corresponding path program 1 times [2025-02-05 11:54:21,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:21,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163328561] [2025-02-05 11:54:21,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:21,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:21,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1089 statements into 1 equivalence classes. [2025-02-05 11:54:21,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1089 of 1089 statements. [2025-02-05 11:54:21,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:21,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:22,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1988 backedges. 1272 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2025-02-05 11:54:22,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163328561] [2025-02-05 11:54:22,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163328561] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:22,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:22,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:54:22,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709743227] [2025-02-05 11:54:22,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:22,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:54:22,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:22,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:54:22,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:54:22,038 INFO L87 Difference]: Start difference. First operand 14107 states and 14381 transitions. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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 11:54:23,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:23,098 INFO L93 Difference]: Finished difference Result 22806 states and 23250 transitions. [2025-02-05 11:54:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:54:23,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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 1089 [2025-02-05 11:54:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:23,123 INFO L225 Difference]: With dead ends: 22806 [2025-02-05 11:54:23,123 INFO L226 Difference]: Without dead ends: 22804 [2025-02-05 11:54:23,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:54:23,131 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 369 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:23,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 80 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 11:54:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22804 states. [2025-02-05 11:54:23,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22804 to 15307. [2025-02-05 11:54:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15307 states, 15306 states have (on average 1.0195348229452503) internal successors, (15605), 15306 states have internal predecessors, (15605), 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 11:54:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15307 states to 15307 states and 15605 transitions. [2025-02-05 11:54:23,286 INFO L78 Accepts]: Start accepts. Automaton has 15307 states and 15605 transitions. Word has length 1089 [2025-02-05 11:54:23,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:23,286 INFO L471 AbstractCegarLoop]: Abstraction has 15307 states and 15605 transitions. [2025-02-05 11:54:23,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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 11:54:23,286 INFO L276 IsEmpty]: Start isEmpty. Operand 15307 states and 15605 transitions. [2025-02-05 11:54:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1186 [2025-02-05 11:54:23,306 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:23,306 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 5, 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, 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, 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, 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, 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] [2025-02-05 11:54:23,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 11:54:23,306 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:23,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash -875116457, now seen corresponding path program 1 times [2025-02-05 11:54:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724746348] [2025-02-05 11:54:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:23,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:23,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-02-05 11:54:23,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-02-05 11:54:23,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:23,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 254 proven. 1108 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [2025-02-05 11:54:24,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:24,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724746348] [2025-02-05 11:54:24,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724746348] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:24,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843794647] [2025-02-05 11:54:24,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:24,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:24,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:54:24,289 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 11:54:24,290 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 11:54:24,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1185 statements into 1 equivalence classes. [2025-02-05 11:54:24,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1185 of 1185 statements. [2025-02-05 11:54:24,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:24,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:24,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1343 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:54:24,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:54:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2221 backedges. 1439 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2025-02-05 11:54:24,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:54:24,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843794647] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:24,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:54:24,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:54:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767405376] [2025-02-05 11:54:24,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:24,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:24,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:24,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:24,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:54:24,852 INFO L87 Difference]: Start difference. First operand 15307 states and 15605 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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 11:54:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:25,553 INFO L93 Difference]: Finished difference Result 32105 states and 32742 transitions. [2025-02-05 11:54:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:25,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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 1185 [2025-02-05 11:54:25,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:25,570 INFO L225 Difference]: With dead ends: 32105 [2025-02-05 11:54:25,571 INFO L226 Difference]: Without dead ends: 19497 [2025-02-05 11:54:25,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1188 GetRequests, 1184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:54:25,579 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 197 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:25,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 369 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:54:25,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19497 states. [2025-02-05 11:54:25,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19497 to 15900. [2025-02-05 11:54:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15900 states, 15899 states have (on average 1.0184917290395623) internal successors, (16193), 15899 states have internal predecessors, (16193), 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 11:54:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15900 states to 15900 states and 16193 transitions. [2025-02-05 11:54:25,707 INFO L78 Accepts]: Start accepts. Automaton has 15900 states and 16193 transitions. Word has length 1185 [2025-02-05 11:54:25,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:25,708 INFO L471 AbstractCegarLoop]: Abstraction has 15900 states and 16193 transitions. [2025-02-05 11:54:25,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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 11:54:25,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15900 states and 16193 transitions. [2025-02-05 11:54:25,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2025-02-05 11:54:25,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:25,723 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 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, 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, 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, 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-02-05 11:54:25,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 11:54:25,923 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,SelfDestructingSolverStorable22 [2025-02-05 11:54:25,924 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:25,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:25,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1097214472, now seen corresponding path program 1 times [2025-02-05 11:54:25,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:25,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846804654] [2025-02-05 11:54:25,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:25,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1213 statements into 1 equivalence classes. [2025-02-05 11:54:26,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1213 of 1213 statements. [2025-02-05 11:54:26,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:26,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2333 backedges. 1135 proven. 0 refuted. 0 times theorem prover too weak. 1198 trivial. 0 not checked. [2025-02-05 11:54:26,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846804654] [2025-02-05 11:54:26,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846804654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:26,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:54:26,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 11:54:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569900897] [2025-02-05 11:54:26,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:26,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 11:54:26,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:26,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 11:54:26,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:54:26,828 INFO L87 Difference]: Start difference. First operand 15900 states and 16193 transitions. Second operand has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 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 11:54:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:28,297 INFO L93 Difference]: Finished difference Result 30596 states and 31168 transitions. [2025-02-05 11:54:28,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 11:54:28,297 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 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 1213 [2025-02-05 11:54:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:28,311 INFO L225 Difference]: With dead ends: 30596 [2025-02-05 11:54:28,311 INFO L226 Difference]: Without dead ends: 17395 [2025-02-05 11:54:28,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:54:28,319 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 428 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 2536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:28,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 555 Invalid, 2536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 2502 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 11:54:28,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17395 states. [2025-02-05 11:54:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17395 to 14997. [2025-02-05 11:54:28,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14997 states, 14996 states have (on average 1.0173379567884768) internal successors, (15256), 14996 states have internal predecessors, (15256), 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 11:54:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14997 states to 14997 states and 15256 transitions. [2025-02-05 11:54:28,448 INFO L78 Accepts]: Start accepts. Automaton has 14997 states and 15256 transitions. Word has length 1213 [2025-02-05 11:54:28,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:28,449 INFO L471 AbstractCegarLoop]: Abstraction has 14997 states and 15256 transitions. [2025-02-05 11:54:28,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 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 11:54:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14997 states and 15256 transitions. [2025-02-05 11:54:28,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1494 [2025-02-05 11:54:28,472 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:28,473 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:54:28,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 11:54:28,473 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:28,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:28,474 INFO L85 PathProgramCache]: Analyzing trace with hash 487453360, now seen corresponding path program 1 times [2025-02-05 11:54:28,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:28,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761716724] [2025-02-05 11:54:28,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:28,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:28,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-02-05 11:54:28,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-02-05 11:54:28,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:28,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 2372 proven. 458 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2025-02-05 11:54:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761716724] [2025-02-05 11:54:30,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761716724] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408928078] [2025-02-05 11:54:30,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:30,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:30,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:54:30,941 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 11:54:30,942 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 11:54:31,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1493 statements into 1 equivalence classes. [2025-02-05 11:54:31,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1493 of 1493 statements. [2025-02-05 11:54:31,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:31,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:31,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 1699 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:54:31,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:54:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3740 backedges. 2481 proven. 0 refuted. 0 times theorem prover too weak. 1259 trivial. 0 not checked. [2025-02-05 11:54:31,549 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:54:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408928078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:54:31,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:54:31,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-05 11:54:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035543889] [2025-02-05 11:54:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:54:31,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:54:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:54:31,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:54:31,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:54:31,552 INFO L87 Difference]: Start difference. First operand 14997 states and 15256 transitions. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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 11:54:32,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:54:32,208 INFO L93 Difference]: Finished difference Result 29395 states and 29905 transitions. [2025-02-05 11:54:32,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:54:32,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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 1493 [2025-02-05 11:54:32,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:54:32,222 INFO L225 Difference]: With dead ends: 29395 [2025-02-05 11:54:32,223 INFO L226 Difference]: Without dead ends: 17095 [2025-02-05 11:54:32,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1498 GetRequests, 1493 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:54:32,232 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 195 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:54:32,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 426 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:54:32,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17095 states. [2025-02-05 11:54:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17095 to 16195. [2025-02-05 11:54:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16195 states, 16194 states have (on average 1.0167345930591578) internal successors, (16465), 16194 states have internal predecessors, (16465), 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 11:54:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16195 states to 16195 states and 16465 transitions. [2025-02-05 11:54:32,355 INFO L78 Accepts]: Start accepts. Automaton has 16195 states and 16465 transitions. Word has length 1493 [2025-02-05 11:54:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:54:32,355 INFO L471 AbstractCegarLoop]: Abstraction has 16195 states and 16465 transitions. [2025-02-05 11:54:32,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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 11:54:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16195 states and 16465 transitions. [2025-02-05 11:54:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2025-02-05 11:54:32,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:54:32,373 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:54:32,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 11:54:32,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:32,574 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:54:32,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:54:32,575 INFO L85 PathProgramCache]: Analyzing trace with hash -408481733, now seen corresponding path program 1 times [2025-02-05 11:54:32,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:54:32,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979941512] [2025-02-05 11:54:32,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:32,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:54:32,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1495 statements into 1 equivalence classes. [2025-02-05 11:54:32,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1495 of 1495 statements. [2025-02-05 11:54:32,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:32,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:34,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4156 backedges. 2622 proven. 460 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2025-02-05 11:54:34,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:54:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979941512] [2025-02-05 11:54:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979941512] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:54:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219053308] [2025-02-05 11:54:34,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:54:34,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:54:34,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:54:34,992 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 11:54:34,993 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 11:54:35,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1495 statements into 1 equivalence classes. [2025-02-05 11:54:35,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1495 of 1495 statements. [2025-02-05 11:54:35,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:54:35,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:54:35,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 1723 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 11:54:35,369 INFO L279 TraceCheckSpWp]: Computing forward predicates...