./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label41.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/Problem17_label41.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 f21db4ac76946ee444b77ff65c558a63b1f97c46b1265b72698e02c79e47e23e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 12:05:24,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 12:05:24,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 12:05:24,366 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 12:05:24,366 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 12:05:24,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 12:05:24,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 12:05:24,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 12:05:24,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 12:05:24,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 12:05:24,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 12:05:24,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 12:05:24,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 12:05:24,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 12:05:24,394 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 12:05:24,394 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 12:05:24,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 12:05:24,394 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 12:05:24,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 12:05:24,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 12:05:24,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 12:05:24,395 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 12:05:24,395 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 12:05:24,395 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 12:05:24,395 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 12:05:24,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 12:05:24,395 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 12:05:24,395 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 12:05:24,396 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 12:05:24,396 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 12:05:24,396 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 12:05:24,397 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 12:05:24,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:05:24,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 12:05:24,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 12:05:24,397 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 12:05:24,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 12:05:24,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 12:05:24,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 12:05:24,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 12:05:24,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 12:05:24,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 12:05:24,398 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 12:05:24,398 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 -> f21db4ac76946ee444b77ff65c558a63b1f97c46b1265b72698e02c79e47e23e [2025-02-05 12:05:24,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 12:05:24,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 12:05:24,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 12:05:24,671 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 12:05:24,671 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 12:05:24,672 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2025-02-05 12:05:25,975 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c36b794/a3c300f5ef4146f5be83f2ca83899367/FLAG6d39daede [2025-02-05 12:05:26,518 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 12:05:26,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label41.c [2025-02-05 12:05:26,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c36b794/a3c300f5ef4146f5be83f2ca83899367/FLAG6d39daede [2025-02-05 12:05:26,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c1c36b794/a3c300f5ef4146f5be83f2ca83899367 [2025-02-05 12:05:26,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 12:05:26,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 12:05:26,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 12:05:26,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 12:05:26,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 12:05:26,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:05:26" (1/1) ... [2025-02-05 12:05:26,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13b28dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:26, skipping insertion in model container [2025-02-05 12:05:26,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:05:26" (1/1) ... [2025-02-05 12:05:26,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 12:05:26,852 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/Problem17_label41.c[5202,5215] [2025-02-05 12:05:27,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:05:27,344 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 12:05:27,358 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/Problem17_label41.c[5202,5215] [2025-02-05 12:05:27,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 12:05:27,614 INFO L204 MainTranslator]: Completed translation [2025-02-05 12:05:27,616 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27 WrapperNode [2025-02-05 12:05:27,616 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 12:05:27,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 12:05:27,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 12:05:27,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 12:05:27,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:27,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:27,904 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-02-05 12:05:27,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 12:05:27,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 12:05:27,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 12:05:27,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 12:05:27,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:27,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:28,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:28,161 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 12:05:28,165 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:28,165 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:28,298 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:28,315 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:28,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:28,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:28,399 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 12:05:28,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 12:05:28,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 12:05:28,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 12:05:28,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (1/1) ... [2025-02-05 12:05:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 12:05:28,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:28,433 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 12:05:28,443 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 12:05:28,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 12:05:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 12:05:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 12:05:28,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 12:05:28,525 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 12:05:28,527 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 12:05:32,226 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-02-05 12:05:32,357 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-02-05 12:05:32,358 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 12:05:32,393 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 12:05:32,393 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 12:05:32,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:05:32 BoogieIcfgContainer [2025-02-05 12:05:32,394 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 12:05:32,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 12:05:32,398 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 12:05:32,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 12:05:32,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:05:26" (1/3) ... [2025-02-05 12:05:32,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2e8212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:05:32, skipping insertion in model container [2025-02-05 12:05:32,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:05:27" (2/3) ... [2025-02-05 12:05:32,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2e8212 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:05:32, skipping insertion in model container [2025-02-05 12:05:32,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:05:32" (3/3) ... [2025-02-05 12:05:32,405 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label41.c [2025-02-05 12:05:32,422 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 12:05:32,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label41.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 12:05:32,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 12:05:32,522 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;@3b3d8b23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 12:05:32,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 12:05:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 12:05:32,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-05 12:05:32,539 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:32,540 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] [2025-02-05 12:05:32,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:32,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:32,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1728760468, now seen corresponding path program 1 times [2025-02-05 12:05:32,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:32,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691827227] [2025-02-05 12:05:32,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:32,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:32,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-05 12:05:32,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-05 12:05:32,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:32,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:32,879 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 12:05:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:32,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691827227] [2025-02-05 12:05:32,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691827227] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:32,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:05:32,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916275491] [2025-02-05 12:05:32,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:32,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:32,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:32,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:32,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:32,911 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:35,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:35,592 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-02-05 12:05:35,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:35,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-02-05 12:05:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:35,610 INFO L225 Difference]: With dead ends: 1667 [2025-02-05 12:05:35,611 INFO L226 Difference]: Without dead ends: 998 [2025-02-05 12:05:35,617 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 12:05:35,620 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 511 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:35,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 12:05:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-02-05 12:05:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-02-05 12:05:35,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 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 12:05:35,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-02-05 12:05:35,733 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 34 [2025-02-05 12:05:35,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:35,734 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-02-05 12:05:35,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-02-05 12:05:35,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 12:05:35,737 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:35,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:05:35,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 12:05:35,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:35,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1733764571, now seen corresponding path program 1 times [2025-02-05 12:05:35,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:35,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517464971] [2025-02-05 12:05:35,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:35,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 12:05:35,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 12:05:35,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:35,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:36,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:36,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517464971] [2025-02-05 12:05:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517464971] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:36,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 12:05:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469180344] [2025-02-05 12:05:36,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:36,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:36,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:36,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:36,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:36,123 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 12:05:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:38,343 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-02-05 12:05:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:38,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2025-02-05 12:05:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:38,353 INFO L225 Difference]: With dead ends: 2824 [2025-02-05 12:05:38,353 INFO L226 Difference]: Without dead ends: 1844 [2025-02-05 12:05:38,357 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 12:05:38,358 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:38,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 12:05:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-02-05 12:05:38,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-02-05 12:05:38,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 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 12:05:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-02-05 12:05:38,413 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 99 [2025-02-05 12:05:38,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:38,414 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-02-05 12:05:38,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 12:05:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-02-05 12:05:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-02-05 12:05:38,417 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:38,417 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:05:38,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 12:05:38,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:38,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:38,421 INFO L85 PathProgramCache]: Analyzing trace with hash -534783869, now seen corresponding path program 1 times [2025-02-05 12:05:38,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:38,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430062223] [2025-02-05 12:05:38,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:38,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:38,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-02-05 12:05:38,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-02-05 12:05:38,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:38,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:38,812 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:38,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:38,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430062223] [2025-02-05 12:05:38,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430062223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:38,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:38,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:38,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054657443] [2025-02-05 12:05:38,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:38,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:38,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:38,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:38,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:38,814 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 12:05:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:40,796 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-02-05 12:05:40,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2025-02-05 12:05:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:40,809 INFO L225 Difference]: With dead ends: 4546 [2025-02-05 12:05:40,810 INFO L226 Difference]: Without dead ends: 2704 [2025-02-05 12:05:40,815 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 12:05:40,817 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:40,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:05:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-02-05 12:05:40,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-02-05 12:05:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 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 12:05:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-02-05 12:05:40,881 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 182 [2025-02-05 12:05:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:40,881 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-02-05 12:05:40,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 12:05:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-02-05 12:05:40,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-02-05 12:05:40,886 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:40,887 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:05:40,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 12:05:40,887 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:40,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1211015788, now seen corresponding path program 1 times [2025-02-05 12:05:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928229693] [2025-02-05 12:05:40,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:40,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:40,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-02-05 12:05:40,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-02-05 12:05:40,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:40,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 12:05:41,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:41,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928229693] [2025-02-05 12:05:41,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928229693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:41,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:41,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:41,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743482657] [2025-02-05 12:05:41,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:41,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:41,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:41,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:41,102 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:43,190 INFO L93 Difference]: Finished difference Result 7954 states and 11040 transitions. [2025-02-05 12:05:43,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:43,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2025-02-05 12:05:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:43,210 INFO L225 Difference]: With dead ends: 7954 [2025-02-05 12:05:43,211 INFO L226 Difference]: Without dead ends: 5252 [2025-02-05 12:05:43,217 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 12:05:43,218 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 414 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:43,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 546 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:05:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2025-02-05 12:05:43,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 4826. [2025-02-05 12:05:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 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 12:05:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2025-02-05 12:05:43,353 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 188 [2025-02-05 12:05:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:43,354 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2025-02-05 12:05:43,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:05:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2025-02-05 12:05:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2025-02-05 12:05:43,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:43,359 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 12:05:43,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 12:05:43,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:43,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash 349453486, now seen corresponding path program 1 times [2025-02-05 12:05:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124466589] [2025-02-05 12:05:43,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:43,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-02-05 12:05:43,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-02-05 12:05:43,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:43,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:05:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124466589] [2025-02-05 12:05:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124466589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:43,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:43,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115728639] [2025-02-05 12:05:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:43,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:43,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:43,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:43,818 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 12:05:45,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:45,863 INFO L93 Difference]: Finished difference Result 13930 states and 17666 transitions. [2025-02-05 12:05:45,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:45,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 201 [2025-02-05 12:05:45,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:45,888 INFO L225 Difference]: With dead ends: 13930 [2025-02-05 12:05:45,888 INFO L226 Difference]: Without dead ends: 7828 [2025-02-05 12:05:45,898 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 12:05:45,899 INFO L435 NwaCegarLoop]: 878 mSDtfsCounter, 418 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:45,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 953 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-02-05 12:05:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7828 states. [2025-02-05 12:05:46,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7828 to 7822. [2025-02-05 12:05:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7822 states, 7821 states have (on average 1.1792609640710907) internal successors, (9223), 7821 states have internal predecessors, (9223), 0 states have call successors, (0), 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 12:05:46,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7822 states to 7822 states and 9223 transitions. [2025-02-05 12:05:46,099 INFO L78 Accepts]: Start accepts. Automaton has 7822 states and 9223 transitions. Word has length 201 [2025-02-05 12:05:46,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:46,100 INFO L471 AbstractCegarLoop]: Abstraction has 7822 states and 9223 transitions. [2025-02-05 12:05:46,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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 12:05:46,100 INFO L276 IsEmpty]: Start isEmpty. Operand 7822 states and 9223 transitions. [2025-02-05 12:05:46,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-02-05 12:05:46,106 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:46,106 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:05:46,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 12:05:46,107 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:46,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash -330951268, now seen corresponding path program 1 times [2025-02-05 12:05:46,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:46,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257294910] [2025-02-05 12:05:46,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:46,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:46,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-02-05 12:05:46,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-02-05 12:05:46,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:46,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:05:46,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:46,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257294910] [2025-02-05 12:05:46,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257294910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:46,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:46,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213821081] [2025-02-05 12:05:46,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:46,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:46,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:46,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:46,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:46,463 INFO L87 Difference]: Start difference. First operand 7822 states and 9223 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 12:05:48,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:48,393 INFO L93 Difference]: Finished difference Result 16499 states and 19469 transitions. [2025-02-05 12:05:48,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:48,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 254 [2025-02-05 12:05:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:48,417 INFO L225 Difference]: With dead ends: 16499 [2025-02-05 12:05:48,417 INFO L226 Difference]: Without dead ends: 8679 [2025-02-05 12:05:48,426 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 12:05:48,427 INFO L435 NwaCegarLoop]: 872 mSDtfsCounter, 402 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:48,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 934 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-05 12:05:48,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8679 states. [2025-02-05 12:05:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8679 to 8249. [2025-02-05 12:05:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8249 states, 8248 states have (on average 1.1793161978661493) internal successors, (9727), 8248 states have internal predecessors, (9727), 0 states have call successors, (0), 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 12:05:48,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8249 states to 8249 states and 9727 transitions. [2025-02-05 12:05:48,587 INFO L78 Accepts]: Start accepts. Automaton has 8249 states and 9727 transitions. Word has length 254 [2025-02-05 12:05:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:48,587 INFO L471 AbstractCegarLoop]: Abstraction has 8249 states and 9727 transitions. [2025-02-05 12:05:48,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 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 12:05:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 8249 states and 9727 transitions. [2025-02-05 12:05:48,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-05 12:05:48,595 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:48,596 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 12:05:48,596 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -987339364, now seen corresponding path program 1 times [2025-02-05 12:05:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54411565] [2025-02-05 12:05:48,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:48,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:48,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 12:05:48,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 12:05:48,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:48,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:49,073 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 202 proven. 70 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 12:05:49,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:49,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54411565] [2025-02-05 12:05:49,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54411565] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:49,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401692754] [2025-02-05 12:05:49,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:49,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:49,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:49,077 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 12:05:49,079 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 12:05:49,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 12:05:49,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 12:05:49,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:49,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:49,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:05:49,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:05:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 202 proven. 70 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 12:05:49,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:05:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 12:05:49,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401692754] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:49,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:05:49,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:05:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875502873] [2025-02-05 12:05:49,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:49,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:49,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:49,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:49,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:05:49,762 INFO L87 Difference]: Start difference. First operand 8249 states and 9727 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 12:05:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:52,717 INFO L93 Difference]: Finished difference Result 28026 states and 33258 transitions. [2025-02-05 12:05:52,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:05:52,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2025-02-05 12:05:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:52,773 INFO L225 Difference]: With dead ends: 28026 [2025-02-05 12:05:52,773 INFO L226 Difference]: Without dead ends: 18923 [2025-02-05 12:05:52,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:05:52,786 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 891 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2244 mSolverCounterSat, 689 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 2244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:52,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 161 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [689 Valid, 2244 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 12:05:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18923 states. [2025-02-05 12:05:53,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18923 to 18921. [2025-02-05 12:05:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18921 states, 18920 states have (on average 1.1585623678646935) internal successors, (21920), 18920 states have internal predecessors, (21920), 0 states have call successors, (0), 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 12:05:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18921 states to 18921 states and 21920 transitions. [2025-02-05 12:05:53,078 INFO L78 Accepts]: Start accepts. Automaton has 18921 states and 21920 transitions. Word has length 258 [2025-02-05 12:05:53,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:53,079 INFO L471 AbstractCegarLoop]: Abstraction has 18921 states and 21920 transitions. [2025-02-05 12:05:53,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 12:05:53,079 INFO L276 IsEmpty]: Start isEmpty. Operand 18921 states and 21920 transitions. [2025-02-05 12:05:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-02-05 12:05:53,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:53,084 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:53,095 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 12:05:53,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:53,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:53,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:53,286 INFO L85 PathProgramCache]: Analyzing trace with hash 931948438, now seen corresponding path program 1 times [2025-02-05 12:05:53,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:53,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837009293] [2025-02-05 12:05:53,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:53,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:53,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-02-05 12:05:53,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-02-05 12:05:53,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:53,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 12:05:53,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:53,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837009293] [2025-02-05 12:05:53,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837009293] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:53,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:53,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:53,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683314136] [2025-02-05 12:05:53,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:53,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:53,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:53,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:53,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:53,566 INFO L87 Difference]: Start difference. First operand 18921 states and 21920 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 12:05:55,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:55,327 INFO L93 Difference]: Finished difference Result 41242 states and 47867 transitions. [2025-02-05 12:05:55,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:55,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 271 [2025-02-05 12:05:55,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:55,384 INFO L225 Difference]: With dead ends: 41242 [2025-02-05 12:05:55,384 INFO L226 Difference]: Without dead ends: 21897 [2025-02-05 12:05:55,404 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 12:05:55,404 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 384 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:55,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 842 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:05:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21897 states. [2025-02-05 12:05:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21897 to 21897. [2025-02-05 12:05:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21897 states, 21896 states have (on average 1.140938984289368) internal successors, (24982), 21896 states have internal predecessors, (24982), 0 states have call successors, (0), 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 12:05:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21897 states to 21897 states and 24982 transitions. [2025-02-05 12:05:55,771 INFO L78 Accepts]: Start accepts. Automaton has 21897 states and 24982 transitions. Word has length 271 [2025-02-05 12:05:55,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:55,772 INFO L471 AbstractCegarLoop]: Abstraction has 21897 states and 24982 transitions. [2025-02-05 12:05:55,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 12:05:55,772 INFO L276 IsEmpty]: Start isEmpty. Operand 21897 states and 24982 transitions. [2025-02-05 12:05:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-05 12:05:55,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:55,778 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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 12:05:55,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 12:05:55,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:55,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:55,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1584598470, now seen corresponding path program 1 times [2025-02-05 12:05:55,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:55,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769680420] [2025-02-05 12:05:55,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:55,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:55,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-05 12:05:55,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-05 12:05:55,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:55,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-02-05 12:05:56,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:56,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769680420] [2025-02-05 12:05:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769680420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:05:56,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:05:56,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:05:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368121947] [2025-02-05 12:05:56,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:56,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:05:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:56,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:05:56,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:05:56,211 INFO L87 Difference]: Start difference. First operand 21897 states and 24982 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 12:05:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:05:58,092 INFO L93 Difference]: Finished difference Result 53201 states and 60828 transitions. [2025-02-05 12:05:58,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:05:58,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 306 [2025-02-05 12:05:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:05:58,239 INFO L225 Difference]: With dead ends: 53201 [2025-02-05 12:05:58,239 INFO L226 Difference]: Without dead ends: 30878 [2025-02-05 12:05:58,259 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 12:05:58,260 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 466 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 12:05:58,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 326 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 12:05:58,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30878 states. [2025-02-05 12:05:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30878 to 21894. [2025-02-05 12:05:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21894 states, 21893 states have (on average 1.139816379664733) internal successors, (24954), 21893 states have internal predecessors, (24954), 0 states have call successors, (0), 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 12:05:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21894 states to 21894 states and 24954 transitions. [2025-02-05 12:05:58,536 INFO L78 Accepts]: Start accepts. Automaton has 21894 states and 24954 transitions. Word has length 306 [2025-02-05 12:05:58,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:05:58,537 INFO L471 AbstractCegarLoop]: Abstraction has 21894 states and 24954 transitions. [2025-02-05 12:05:58,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 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 12:05:58,537 INFO L276 IsEmpty]: Start isEmpty. Operand 21894 states and 24954 transitions. [2025-02-05 12:05:58,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-05 12:05:58,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:05:58,544 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 12:05:58,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 12:05:58,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:05:58,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:05:58,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1462150750, now seen corresponding path program 1 times [2025-02-05 12:05:58,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:05:58,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620210780] [2025-02-05 12:05:58,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:58,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:05:58,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 12:05:58,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 12:05:58,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:58,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 343 proven. 73 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-02-05 12:05:59,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:05:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620210780] [2025-02-05 12:05:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620210780] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637506398] [2025-02-05 12:05:59,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:05:59,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:05:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:05:59,056 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 12:05:59,059 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 12:05:59,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 12:05:59,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 12:05:59,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:05:59,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:05:59,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 12:05:59,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:05:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 343 proven. 73 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-02-05 12:05:59,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:05:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-02-05 12:05:59,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637506398] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 12:05:59,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 12:05:59,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 12:05:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757954302] [2025-02-05 12:05:59,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:05:59,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:05:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:05:59,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:05:59,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:05:59,674 INFO L87 Difference]: Start difference. First operand 21894 states and 24954 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:06:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:02,538 INFO L93 Difference]: Finished difference Result 56162 states and 64116 transitions. [2025-02-05 12:06:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:02,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 332 [2025-02-05 12:06:02,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:02,605 INFO L225 Difference]: With dead ends: 56162 [2025-02-05 12:06:02,605 INFO L226 Difference]: Without dead ends: 33843 [2025-02-05 12:06:02,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 12:06:02,624 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 856 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 2839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:02,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 205 Invalid, 2839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 12:06:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33843 states. [2025-02-05 12:06:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33843 to 31715. [2025-02-05 12:06:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31715 states, 31714 states have (on average 1.1472851106766728) internal successors, (36385), 31714 states have internal predecessors, (36385), 0 states have call successors, (0), 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 12:06:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31715 states to 31715 states and 36385 transitions. [2025-02-05 12:06:03,032 INFO L78 Accepts]: Start accepts. Automaton has 31715 states and 36385 transitions. Word has length 332 [2025-02-05 12:06:03,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:03,032 INFO L471 AbstractCegarLoop]: Abstraction has 31715 states and 36385 transitions. [2025-02-05 12:06:03,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 12:06:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 31715 states and 36385 transitions. [2025-02-05 12:06:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-02-05 12:06:03,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:03,040 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:06:03,050 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 12:06:03,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:06:03,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:03,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:03,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1715314933, now seen corresponding path program 1 times [2025-02-05 12:06:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:03,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920752594] [2025-02-05 12:06:03,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:03,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:03,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-02-05 12:06:03,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-02-05 12:06:03,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:03,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:03,699 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:06:03,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:03,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920752594] [2025-02-05 12:06:03,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920752594] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:03,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:03,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:03,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676982576] [2025-02-05 12:06:03,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:03,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:03,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:03,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:03,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:03,702 INFO L87 Difference]: Start difference. First operand 31715 states and 36385 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 12:06:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:05,400 INFO L93 Difference]: Finished difference Result 68124 states and 78158 transitions. [2025-02-05 12:06:05,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:05,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 346 [2025-02-05 12:06:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:05,445 INFO L225 Difference]: With dead ends: 68124 [2025-02-05 12:06:05,445 INFO L226 Difference]: Without dead ends: 35980 [2025-02-05 12:06:05,474 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 12:06:05,475 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 442 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:05,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 833 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 12:06:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35980 states. [2025-02-05 12:06:05,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35980 to 33848. [2025-02-05 12:06:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33848 states, 33847 states have (on average 1.1451827340680119) internal successors, (38761), 33847 states have internal predecessors, (38761), 0 states have call successors, (0), 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 12:06:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33848 states to 33848 states and 38761 transitions. [2025-02-05 12:06:06,018 INFO L78 Accepts]: Start accepts. Automaton has 33848 states and 38761 transitions. Word has length 346 [2025-02-05 12:06:06,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:06,019 INFO L471 AbstractCegarLoop]: Abstraction has 33848 states and 38761 transitions. [2025-02-05 12:06:06,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 12:06:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 33848 states and 38761 transitions. [2025-02-05 12:06:06,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-05 12:06:06,025 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:06,026 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:06:06,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 12:06:06,027 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:06,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1884966474, now seen corresponding path program 1 times [2025-02-05 12:06:06,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:06,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090203400] [2025-02-05 12:06:06,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:06,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:06,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-05 12:06:06,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-05 12:06:06,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:06,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-02-05 12:06:06,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:06,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090203400] [2025-02-05 12:06:06,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090203400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:06,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:06,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:06,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625907672] [2025-02-05 12:06:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:06,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:06,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:06,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:06,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:06,281 INFO L87 Difference]: Start difference. First operand 33848 states and 38761 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 12:06:08,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:08,153 INFO L93 Difference]: Finished difference Result 71950 states and 82485 transitions. [2025-02-05 12:06:08,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:08,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 377 [2025-02-05 12:06:08,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:08,199 INFO L225 Difference]: With dead ends: 71950 [2025-02-05 12:06:08,199 INFO L226 Difference]: Without dead ends: 37679 [2025-02-05 12:06:08,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 12:06:08,220 INFO L435 NwaCegarLoop]: 806 mSDtfsCounter, 407 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:08,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 879 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:06:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37679 states. [2025-02-05 12:06:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37679 to 37677. [2025-02-05 12:06:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37677 states, 37676 states have (on average 1.1356301093534344) internal successors, (42786), 37676 states have internal predecessors, (42786), 0 states have call successors, (0), 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 12:06:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37677 states to 37677 states and 42786 transitions. [2025-02-05 12:06:08,606 INFO L78 Accepts]: Start accepts. Automaton has 37677 states and 42786 transitions. Word has length 377 [2025-02-05 12:06:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:08,607 INFO L471 AbstractCegarLoop]: Abstraction has 37677 states and 42786 transitions. [2025-02-05 12:06:08,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 12:06:08,607 INFO L276 IsEmpty]: Start isEmpty. Operand 37677 states and 42786 transitions. [2025-02-05 12:06:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2025-02-05 12:06:08,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:08,615 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:06:08,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 12:06:08,615 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:08,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash 256967293, now seen corresponding path program 1 times [2025-02-05 12:06:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:08,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548234983] [2025-02-05 12:06:08,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:08,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-05 12:06:08,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-05 12:06:08,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:08,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 282 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-02-05 12:06:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:09,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548234983] [2025-02-05 12:06:09,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548234983] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:09,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:09,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 12:06:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345763780] [2025-02-05 12:06:09,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:09,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 12:06:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:09,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 12:06:09,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 12:06:09,502 INFO L87 Difference]: Start difference. First operand 37677 states and 42786 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 12:06:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:11,805 INFO L93 Difference]: Finished difference Result 87315 states and 99224 transitions. [2025-02-05 12:06:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 12:06:11,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 12:06:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:11,877 INFO L225 Difference]: With dead ends: 87315 [2025-02-05 12:06:11,877 INFO L226 Difference]: Without dead ends: 49206 [2025-02-05 12:06:11,908 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 12:06:11,909 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 753 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:11,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 803 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 12:06:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49206 states. [2025-02-05 12:06:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49206 to 43221. [2025-02-05 12:06:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43221 states, 43220 states have (on average 1.1329939842665433) internal successors, (48968), 43220 states have internal predecessors, (48968), 0 states have call successors, (0), 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 12:06:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43221 states to 43221 states and 48968 transitions. [2025-02-05 12:06:12,565 INFO L78 Accepts]: Start accepts. Automaton has 43221 states and 48968 transitions. Word has length 416 [2025-02-05 12:06:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:12,566 INFO L471 AbstractCegarLoop]: Abstraction has 43221 states and 48968 transitions. [2025-02-05 12:06:12,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 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 12:06:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 43221 states and 48968 transitions. [2025-02-05 12:06:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-02-05 12:06:12,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:12,578 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 12:06:12,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 12:06:12,579 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:12,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:12,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1875219563, now seen corresponding path program 1 times [2025-02-05 12:06:12,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:12,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200097713] [2025-02-05 12:06:12,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:12,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-02-05 12:06:12,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-02-05 12:06:12,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:12,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-02-05 12:06:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:12,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200097713] [2025-02-05 12:06:12,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200097713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:12,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:12,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:12,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933527594] [2025-02-05 12:06:12,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:12,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:12,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:12,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:12,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:12,935 INFO L87 Difference]: Start difference. First operand 43221 states and 48968 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 12:06:14,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:14,795 INFO L93 Difference]: Finished difference Result 94956 states and 106816 transitions. [2025-02-05 12:06:14,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:14,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 457 [2025-02-05 12:06:14,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:14,868 INFO L225 Difference]: With dead ends: 94956 [2025-02-05 12:06:14,868 INFO L226 Difference]: Without dead ends: 51312 [2025-02-05 12:06:14,903 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 12:06:14,904 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 491 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1292 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:14,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 281 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1292 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 12:06:14,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51312 states. [2025-02-05 12:06:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51312 to 41909. [2025-02-05 12:06:15,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41909 states, 41908 states have (on average 1.1245585568387897) internal successors, (47128), 41908 states have internal predecessors, (47128), 0 states have call successors, (0), 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 12:06:15,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41909 states to 41909 states and 47128 transitions. [2025-02-05 12:06:15,501 INFO L78 Accepts]: Start accepts. Automaton has 41909 states and 47128 transitions. Word has length 457 [2025-02-05 12:06:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:15,502 INFO L471 AbstractCegarLoop]: Abstraction has 41909 states and 47128 transitions. [2025-02-05 12:06:15,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 12:06:15,502 INFO L276 IsEmpty]: Start isEmpty. Operand 41909 states and 47128 transitions. [2025-02-05 12:06:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2025-02-05 12:06:15,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:15,508 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 12:06:15,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 12:06:15,508 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:15,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:15,509 INFO L85 PathProgramCache]: Analyzing trace with hash -431017673, now seen corresponding path program 1 times [2025-02-05 12:06:15,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:15,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994504] [2025-02-05 12:06:15,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:15,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:15,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-05 12:06:15,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-05 12:06:15,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:15,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 332 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 12:06:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994504] [2025-02-05 12:06:16,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994504] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 12:06:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935089159] [2025-02-05 12:06:16,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:16,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 12:06:16,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 12:06:16,376 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 12:06:16,379 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 12:06:16,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-02-05 12:06:16,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-02-05 12:06:16,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:16,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:16,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 12:06:16,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 12:06:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 12:06:16,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 12:06:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 12:06:17,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935089159] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 12:06:17,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 12:06:17,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-02-05 12:06:17,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192844546] [2025-02-05 12:06:17,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 12:06:17,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 12:06:17,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:17,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 12:06:17,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 12:06:17,860 INFO L87 Difference]: Start difference. First operand 41909 states and 47128 transitions. Second operand has 9 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 0 states have call successors, (0), 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 12:06:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:29,433 INFO L93 Difference]: Finished difference Result 139202 states and 157831 transitions. [2025-02-05 12:06:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 12:06:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 0 states have call successors, (0), 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 469 [2025-02-05 12:06:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:29,556 INFO L225 Difference]: With dead ends: 139202 [2025-02-05 12:06:29,556 INFO L226 Difference]: Without dead ends: 94743 [2025-02-05 12:06:29,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 965 GetRequests, 946 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2025-02-05 12:06:29,589 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 6435 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 13903 mSolverCounterSat, 2555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6435 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 16458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2555 IncrementalHoareTripleChecker+Valid, 13903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:29,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6435 Valid, 513 Invalid, 16458 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2555 Valid, 13903 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2025-02-05 12:06:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94743 states. [2025-02-05 12:06:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94743 to 82768. [2025-02-05 12:06:30,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82768 states, 82767 states have (on average 1.127430014377711) internal successors, (93314), 82767 states have internal predecessors, (93314), 0 states have call successors, (0), 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 12:06:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82768 states to 82768 states and 93314 transitions. [2025-02-05 12:06:30,804 INFO L78 Accepts]: Start accepts. Automaton has 82768 states and 93314 transitions. Word has length 469 [2025-02-05 12:06:30,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:30,805 INFO L471 AbstractCegarLoop]: Abstraction has 82768 states and 93314 transitions. [2025-02-05 12:06:30,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 0 states have call successors, (0), 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 12:06:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 82768 states and 93314 transitions. [2025-02-05 12:06:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-05 12:06:30,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:30,814 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 12:06:30,823 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 12:06:31,019 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 12:06:31,019 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:31,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:31,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1401590326, now seen corresponding path program 1 times [2025-02-05 12:06:31,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:31,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363489494] [2025-02-05 12:06:31,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:31,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:31,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 12:06:31,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 12:06:31,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:31,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-02-05 12:06:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363489494] [2025-02-05 12:06:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363489494] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:31,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:31,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192197357] [2025-02-05 12:06:31,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:31,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:31,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:31,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:31,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:31,502 INFO L87 Difference]: Start difference. First operand 82768 states and 93314 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 12:06:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:33,256 INFO L93 Difference]: Finished difference Result 184678 states and 207928 transitions. [2025-02-05 12:06:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:33,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 478 [2025-02-05 12:06:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:33,377 INFO L225 Difference]: With dead ends: 184678 [2025-02-05 12:06:33,377 INFO L226 Difference]: Without dead ends: 98085 [2025-02-05 12:06:33,440 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 12:06:33,440 INFO L435 NwaCegarLoop]: 762 mSDtfsCounter, 425 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:33,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 823 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 12:06:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98085 states. [2025-02-05 12:06:34,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98085 to 85292. [2025-02-05 12:06:34,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85292 states, 85291 states have (on average 1.113106892872636) internal successors, (94938), 85291 states have internal predecessors, (94938), 0 states have call successors, (0), 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 12:06:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85292 states to 85292 states and 94938 transitions. [2025-02-05 12:06:34,733 INFO L78 Accepts]: Start accepts. Automaton has 85292 states and 94938 transitions. Word has length 478 [2025-02-05 12:06:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 12:06:34,733 INFO L471 AbstractCegarLoop]: Abstraction has 85292 states and 94938 transitions. [2025-02-05 12:06:34,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 12:06:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 85292 states and 94938 transitions. [2025-02-05 12:06:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-05 12:06:34,742 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 12:06:34,742 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-02-05 12:06:34,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 12:06:34,742 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 12:06:34,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 12:06:34,743 INFO L85 PathProgramCache]: Analyzing trace with hash -805672076, now seen corresponding path program 1 times [2025-02-05 12:06:34,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 12:06:34,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158125098] [2025-02-05 12:06:34,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 12:06:34,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 12:06:34,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-05 12:06:34,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-05 12:06:34,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 12:06:34,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 12:06:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-02-05 12:06:35,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 12:06:35,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158125098] [2025-02-05 12:06:35,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158125098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 12:06:35,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 12:06:35,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 12:06:35,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107760531] [2025-02-05 12:06:35,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 12:06:35,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 12:06:35,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 12:06:35,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 12:06:35,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 12:06:35,257 INFO L87 Difference]: Start difference. First operand 85292 states and 94938 transitions. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 12:06:37,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 12:06:37,125 INFO L93 Difference]: Finished difference Result 176069 states and 195153 transitions. [2025-02-05 12:06:37,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 12:06:37,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 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 503 [2025-02-05 12:06:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 12:06:37,253 INFO L225 Difference]: With dead ends: 176069 [2025-02-05 12:06:37,253 INFO L226 Difference]: Without dead ends: 88647 [2025-02-05 12:06:37,311 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 12:06:37,312 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 442 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 12:06:37,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 561 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]