./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label49.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label49.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 e2ce90b08f9dc9315f13f0d8408b309f0856f833532caca0391f68d5a9cb9786 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:11:51,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:11:51,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:11:51,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:11:51,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:11:51,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:11:51,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:11:51,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:11:51,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:11:51,418 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:11:51,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:11:51,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:11:51,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:11:51,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:11:51,419 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:11:51,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:11:51,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:11:51,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:11:51,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:11:51,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:11:51,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:11:51,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:11:51,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:11:51,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:11:51,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:11:51,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:11:51,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:11:51,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:11:51,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:11:51,421 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:11:51,421 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:11:51,421 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:11:51,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:51,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:11:51,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:11:51,422 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:11:51,422 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:11:51,422 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:11:51,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:11:51,422 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:11:51,422 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:11:51,422 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:11:51,422 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:11:51,422 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/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 -> e2ce90b08f9dc9315f13f0d8408b309f0856f833532caca0391f68d5a9cb9786 [2025-03-16 14:11:51,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:11:51,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:11:51,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:11:51,670 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:11:51,670 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:11:51,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label49.c [2025-03-16 14:11:52,811 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e40eaff81/4fc238f56c2d4a73b9b3b805dad35cd7/FLAG2a74fc87b [2025-03-16 14:11:53,120 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:11:53,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label49.c [2025-03-16 14:11:53,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e40eaff81/4fc238f56c2d4a73b9b3b805dad35cd7/FLAG2a74fc87b [2025-03-16 14:11:53,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e40eaff81/4fc238f56c2d4a73b9b3b805dad35cd7 [2025-03-16 14:11:53,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:11:53,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:11:53,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:53,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:11:53,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:11:53,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71218af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53, skipping insertion in model container [2025-03-16 14:11:53,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:11:53,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label49.c[56899,56912] [2025-03-16 14:11:53,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:53,733 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:11:53,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label49.c[56899,56912] [2025-03-16 14:11:53,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:11:53,861 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:11:53,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53 WrapperNode [2025-03-16 14:11:53,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:11:53,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:53,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:11:53,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:11:53,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,896 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,984 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-16 14:11:53,985 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:11:53,986 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:11:53,986 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:11:53,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:11:53,993 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:53,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:54,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:54,048 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-03-16 14:11:54,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:54,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:54,085 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:54,091 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:54,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:54,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:54,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:11:54,111 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:11:54,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:11:54,112 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:11:54,113 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (1/1) ... [2025-03-16 14:11:54,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:11:54,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:11:54,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 14:11:54,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 14:11:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:11:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:11:54,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:11:54,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:11:54,214 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:11:54,215 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:11:55,522 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-16 14:11:55,522 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:11:55,538 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:11:55,538 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:11:55,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:55 BoogieIcfgContainer [2025-03-16 14:11:55,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:11:55,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:11:55,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:11:55,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:11:55,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:11:53" (1/3) ... [2025-03-16 14:11:55,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afcea0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:55, skipping insertion in model container [2025-03-16 14:11:55,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:11:53" (2/3) ... [2025-03-16 14:11:55,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afcea0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:11:55, skipping insertion in model container [2025-03-16 14:11:55,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:11:55" (3/3) ... [2025-03-16 14:11:55,548 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label49.c [2025-03-16 14:11:55,557 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:11:55,559 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label49.c that has 1 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:11:55,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:11:55,615 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;@7d4dfe77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:11:55,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:11:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 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-03-16 14:11:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 14:11:55,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:55,635 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:55,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:55,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash 326016686, now seen corresponding path program 1 times [2025-03-16 14:11:55,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:55,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484242951] [2025-03-16 14:11:55,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:55,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:55,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 14:11:55,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 14:11:55,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:55,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:56,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:56,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484242951] [2025-03-16 14:11:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484242951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:56,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:56,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610546667] [2025-03-16 14:11:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:11:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:56,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:11:56,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:56,124 INFO L87 Difference]: Start difference. First operand has 241 states, 239 states have (on average 1.9121338912133892) internal successors, (457), 240 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:56,157 INFO L93 Difference]: Finished difference Result 481 states and 913 transitions. [2025-03-16 14:11:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:11:56,159 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2025-03-16 14:11:56,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:56,169 INFO L225 Difference]: With dead ends: 481 [2025-03-16 14:11:56,169 INFO L226 Difference]: Without dead ends: 238 [2025-03-16 14:11:56,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:11:56,174 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:56,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:11:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-16 14:11:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2025-03-16 14:11:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 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-03-16 14:11:56,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2025-03-16 14:11:56,208 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 167 [2025-03-16 14:11:56,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:56,209 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2025-03-16 14:11:56,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:56,209 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2025-03-16 14:11:56,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-16 14:11:56,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:56,212 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:56,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:11:56,212 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:56,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:56,212 INFO L85 PathProgramCache]: Analyzing trace with hash 214904878, now seen corresponding path program 1 times [2025-03-16 14:11:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:56,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059648270] [2025-03-16 14:11:56,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:56,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:56,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-16 14:11:56,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-16 14:11:56,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:56,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:56,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059648270] [2025-03-16 14:11:56,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059648270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:56,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:56,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:56,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203105641] [2025-03-16 14:11:56,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:56,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:56,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:56,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:56,687 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:57,447 INFO L93 Difference]: Finished difference Result 701 states and 1160 transitions. [2025-03-16 14:11:57,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:57,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2025-03-16 14:11:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:57,452 INFO L225 Difference]: With dead ends: 701 [2025-03-16 14:11:57,453 INFO L226 Difference]: Without dead ends: 464 [2025-03-16 14:11:57,454 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-03-16 14:11:57,456 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:57,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 132 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:11:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-16 14:11:57,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 458. [2025-03-16 14:11:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 457 states have (on average 1.5579868708971554) internal successors, (712), 457 states have internal predecessors, (712), 0 states have call successors, (0), 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-03-16 14:11:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 712 transitions. [2025-03-16 14:11:57,489 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 712 transitions. Word has length 167 [2025-03-16 14:11:57,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:57,490 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 712 transitions. [2025-03-16 14:11:57,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:11:57,490 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 712 transitions. [2025-03-16 14:11:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-16 14:11:57,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:57,493 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:57,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:11:57,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:57,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash 358930112, now seen corresponding path program 1 times [2025-03-16 14:11:57,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:57,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095155402] [2025-03-16 14:11:57,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:57,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:57,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-16 14:11:57,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-16 14:11:57,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:57,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:57,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:57,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095155402] [2025-03-16 14:11:57,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095155402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:57,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:57,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:57,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949720932] [2025-03-16 14:11:57,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:57,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:57,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:57,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:57,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:57,661 INFO L87 Difference]: Start difference. First operand 458 states and 712 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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-03-16 14:11:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:58,337 INFO L93 Difference]: Finished difference Result 1342 states and 2101 transitions. [2025-03-16 14:11:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:58,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 175 [2025-03-16 14:11:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:58,341 INFO L225 Difference]: With dead ends: 1342 [2025-03-16 14:11:58,342 INFO L226 Difference]: Without dead ends: 885 [2025-03-16 14:11:58,344 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-03-16 14:11:58,347 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 247 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:58,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:11:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-16 14:11:58,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 867. [2025-03-16 14:11:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.533487297921478) internal successors, (1328), 866 states have internal predecessors, (1328), 0 states have call successors, (0), 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-03-16 14:11:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1328 transitions. [2025-03-16 14:11:58,368 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1328 transitions. Word has length 175 [2025-03-16 14:11:58,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:58,368 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1328 transitions. [2025-03-16 14:11:58,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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-03-16 14:11:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1328 transitions. [2025-03-16 14:11:58,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-16 14:11:58,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:58,372 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:58,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:11:58,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:58,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:58,373 INFO L85 PathProgramCache]: Analyzing trace with hash 188833820, now seen corresponding path program 1 times [2025-03-16 14:11:58,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:58,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647143139] [2025-03-16 14:11:58,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:58,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:58,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-16 14:11:58,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-16 14:11:58,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:58,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:11:58,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:58,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647143139] [2025-03-16 14:11:58,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647143139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:58,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:58,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:58,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876229636] [2025-03-16 14:11:58,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:58,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:58,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:58,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:58,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:58,528 INFO L87 Difference]: Start difference. First operand 867 states and 1328 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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-03-16 14:11:58,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:58,850 INFO L93 Difference]: Finished difference Result 1709 states and 2621 transitions. [2025-03-16 14:11:58,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:58,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2025-03-16 14:11:58,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:58,853 INFO L225 Difference]: With dead ends: 1709 [2025-03-16 14:11:58,853 INFO L226 Difference]: Without dead ends: 843 [2025-03-16 14:11:58,854 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-03-16 14:11:58,854 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:58,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 30 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:11:58,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2025-03-16 14:11:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 843. [2025-03-16 14:11:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.477434679334917) internal successors, (1244), 842 states have internal predecessors, (1244), 0 states have call successors, (0), 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-03-16 14:11:58,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1244 transitions. [2025-03-16 14:11:58,868 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1244 transitions. Word has length 180 [2025-03-16 14:11:58,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:58,868 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1244 transitions. [2025-03-16 14:11:58,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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-03-16 14:11:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1244 transitions. [2025-03-16 14:11:58,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 14:11:58,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:58,870 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:58,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:11:58,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:58,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 961865848, now seen corresponding path program 1 times [2025-03-16 14:11:58,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:58,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194876621] [2025-03-16 14:11:58,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:58,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:58,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-16 14:11:58,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 14:11:58,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:58,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:59,049 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 14:11:59,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:59,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194876621] [2025-03-16 14:11:59,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194876621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:59,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:59,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:59,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631289020] [2025-03-16 14:11:59,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:59,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:59,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:59,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:59,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:59,051 INFO L87 Difference]: Start difference. First operand 843 states and 1244 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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-03-16 14:11:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:11:59,624 INFO L93 Difference]: Finished difference Result 2497 states and 3689 transitions. [2025-03-16 14:11:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:11:59,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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 181 [2025-03-16 14:11:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:11:59,629 INFO L225 Difference]: With dead ends: 2497 [2025-03-16 14:11:59,629 INFO L226 Difference]: Without dead ends: 1655 [2025-03-16 14:11:59,631 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-03-16 14:11:59,631 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 209 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:11:59,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 141 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:11:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2025-03-16 14:11:59,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1655. [2025-03-16 14:11:59,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1654 states have (on average 1.3071342200725513) internal successors, (2162), 1654 states have internal predecessors, (2162), 0 states have call successors, (0), 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-03-16 14:11:59,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2162 transitions. [2025-03-16 14:11:59,656 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2162 transitions. Word has length 181 [2025-03-16 14:11:59,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:11:59,657 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2162 transitions. [2025-03-16 14:11:59,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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-03-16 14:11:59,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2162 transitions. [2025-03-16 14:11:59,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 14:11:59,659 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:11:59,659 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:11:59,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:11:59,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:11:59,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:11:59,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1090750339, now seen corresponding path program 1 times [2025-03-16 14:11:59,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:11:59,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627871412] [2025-03-16 14:11:59,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:11:59,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:11:59,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 14:11:59,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 14:11:59,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:11:59,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:11:59,939 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:11:59,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:11:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627871412] [2025-03-16 14:11:59,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627871412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:11:59,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:11:59,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:11:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308361223] [2025-03-16 14:11:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:11:59,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:11:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:11:59,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:11:59,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:11:59,943 INFO L87 Difference]: Start difference. First operand 1655 states and 2162 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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-03-16 14:12:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:00,614 INFO L93 Difference]: Finished difference Result 4961 states and 6482 transitions. [2025-03-16 14:12:00,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:00,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 186 [2025-03-16 14:12:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:00,624 INFO L225 Difference]: With dead ends: 4961 [2025-03-16 14:12:00,625 INFO L226 Difference]: Without dead ends: 3307 [2025-03-16 14:12:00,627 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-03-16 14:12:00,629 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 286 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:00,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 50 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2025-03-16 14:12:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3304. [2025-03-16 14:12:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3304 states, 3303 states have (on average 1.301544050862852) internal successors, (4299), 3303 states have internal predecessors, (4299), 0 states have call successors, (0), 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-03-16 14:12:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 4299 transitions. [2025-03-16 14:12:00,696 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 4299 transitions. Word has length 186 [2025-03-16 14:12:00,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:00,696 INFO L471 AbstractCegarLoop]: Abstraction has 3304 states and 4299 transitions. [2025-03-16 14:12:00,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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-03-16 14:12:00,696 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 4299 transitions. [2025-03-16 14:12:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-16 14:12:00,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:00,700 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 14:12:00,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:12:00,700 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:00,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash -92667743, now seen corresponding path program 1 times [2025-03-16 14:12:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:00,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109496214] [2025-03-16 14:12:00,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:00,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:00,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 14:12:00,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:12:00,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:00,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 14:12:00,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:00,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109496214] [2025-03-16 14:12:00,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109496214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:00,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921969776] [2025-03-16 14:12:00,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:00,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:00,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:00,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:00,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 14:12:00,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-16 14:12:01,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-16 14:12:01,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:01,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:01,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:01,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:01,104 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-16 14:12:01,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:01,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921969776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:01,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-16 14:12:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625013147] [2025-03-16 14:12:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:01,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:01,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:01,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:01,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:01,109 INFO L87 Difference]: Start difference. First operand 3304 states and 4299 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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-03-16 14:12:01,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:01,328 INFO L93 Difference]: Finished difference Result 9902 states and 12887 transitions. [2025-03-16 14:12:01,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:01,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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 187 [2025-03-16 14:12:01,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:01,344 INFO L225 Difference]: With dead ends: 9902 [2025-03-16 14:12:01,344 INFO L226 Difference]: Without dead ends: 6599 [2025-03-16 14:12:01,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:01,349 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 321 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:01,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 534 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:12:01,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2025-03-16 14:12:01,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6591. [2025-03-16 14:12:01,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6591 states, 6590 states have (on average 1.301062215477997) internal successors, (8574), 6590 states have internal predecessors, (8574), 0 states have call successors, (0), 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-03-16 14:12:01,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 8574 transitions. [2025-03-16 14:12:01,489 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 8574 transitions. Word has length 187 [2025-03-16 14:12:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:01,490 INFO L471 AbstractCegarLoop]: Abstraction has 6591 states and 8574 transitions. [2025-03-16 14:12:01,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 0 states have call successors, (0), 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-03-16 14:12:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 8574 transitions. [2025-03-16 14:12:01,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-16 14:12:01,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:01,495 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:01,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 14:12:01,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:01,697 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:01,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:01,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1044427844, now seen corresponding path program 1 times [2025-03-16 14:12:01,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:01,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453565589] [2025-03-16 14:12:01,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:01,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:01,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-16 14:12:01,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-16 14:12:01,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:01,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 28 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:01,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:01,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453565589] [2025-03-16 14:12:01,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453565589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:01,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941270140] [2025-03-16 14:12:01,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:01,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:01,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:01,870 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:01,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 14:12:01,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-16 14:12:01,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-16 14:12:01,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:01,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:01,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:01,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:12:01,995 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:01,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941270140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:01,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:01,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:12:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468479606] [2025-03-16 14:12:01,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:01,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:01,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:01,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:01,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:01,997 INFO L87 Difference]: Start difference. First operand 6591 states and 8574 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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-03-16 14:12:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:02,685 INFO L93 Difference]: Finished difference Result 16437 states and 21943 transitions. [2025-03-16 14:12:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 189 [2025-03-16 14:12:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:02,713 INFO L225 Difference]: With dead ends: 16437 [2025-03-16 14:12:02,713 INFO L226 Difference]: Without dead ends: 9847 [2025-03-16 14:12:02,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:02,722 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 210 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:02,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 365 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9847 states. [2025-03-16 14:12:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9847 to 9839. [2025-03-16 14:12:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9839 states, 9838 states have (on average 1.2354137019719456) internal successors, (12154), 9838 states have internal predecessors, (12154), 0 states have call successors, (0), 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-03-16 14:12:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9839 states to 9839 states and 12154 transitions. [2025-03-16 14:12:02,923 INFO L78 Accepts]: Start accepts. Automaton has 9839 states and 12154 transitions. Word has length 189 [2025-03-16 14:12:02,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:02,923 INFO L471 AbstractCegarLoop]: Abstraction has 9839 states and 12154 transitions. [2025-03-16 14:12:02,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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-03-16 14:12:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 9839 states and 12154 transitions. [2025-03-16 14:12:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 14:12:02,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:02,930 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:02,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 14:12:03,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-16 14:12:03,132 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:03,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:03,133 INFO L85 PathProgramCache]: Analyzing trace with hash -445622334, now seen corresponding path program 1 times [2025-03-16 14:12:03,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:03,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797328479] [2025-03-16 14:12:03,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:03,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:03,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 14:12:03,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 14:12:03,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:03,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:03,403 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:12:03,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:03,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797328479] [2025-03-16 14:12:03,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797328479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:03,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:03,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:03,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967794115] [2025-03-16 14:12:03,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:03,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:12:03,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:03,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:12:03,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:03,406 INFO L87 Difference]: Start difference. First operand 9839 states and 12154 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-03-16 14:12:04,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:04,093 INFO L93 Difference]: Finished difference Result 19699 states and 24349 transitions. [2025-03-16 14:12:04,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:12:04,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 223 [2025-03-16 14:12:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:04,124 INFO L225 Difference]: With dead ends: 19699 [2025-03-16 14:12:04,124 INFO L226 Difference]: Without dead ends: 9861 [2025-03-16 14:12:04,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:04,136 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 795 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:04,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 43 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9861 states. [2025-03-16 14:12:04,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9861 to 9839. [2025-03-16 14:12:04,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9839 states, 9838 states have (on average 1.2256556210611913) internal successors, (12058), 9838 states have internal predecessors, (12058), 0 states have call successors, (0), 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-03-16 14:12:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9839 states to 9839 states and 12058 transitions. [2025-03-16 14:12:04,357 INFO L78 Accepts]: Start accepts. Automaton has 9839 states and 12058 transitions. Word has length 223 [2025-03-16 14:12:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:04,357 INFO L471 AbstractCegarLoop]: Abstraction has 9839 states and 12058 transitions. [2025-03-16 14:12:04,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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-03-16 14:12:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 9839 states and 12058 transitions. [2025-03-16 14:12:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-16 14:12:04,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:04,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:04,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:12:04,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:04,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:04,369 INFO L85 PathProgramCache]: Analyzing trace with hash -115182364, now seen corresponding path program 1 times [2025-03-16 14:12:04,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:04,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515043105] [2025-03-16 14:12:04,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:04,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:04,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-16 14:12:04,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-16 14:12:04,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:04,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:12:04,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:04,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515043105] [2025-03-16 14:12:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515043105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:04,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:12:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253885467] [2025-03-16 14:12:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:04,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:04,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:04,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:04,681 INFO L87 Difference]: Start difference. First operand 9839 states and 12058 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 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-03-16 14:12:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:05,256 INFO L93 Difference]: Finished difference Result 22955 states and 27871 transitions. [2025-03-16 14:12:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:05,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 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 237 [2025-03-16 14:12:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:05,277 INFO L225 Difference]: With dead ends: 22955 [2025-03-16 14:12:05,277 INFO L226 Difference]: Without dead ends: 13117 [2025-03-16 14:12:05,288 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-03-16 14:12:05,289 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:05,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 113 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:05,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13117 states. [2025-03-16 14:12:05,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13117 to 13109. [2025-03-16 14:12:05,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13109 states, 13108 states have (on average 1.2018614586512053) internal successors, (15754), 13108 states have internal predecessors, (15754), 0 states have call successors, (0), 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-03-16 14:12:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13109 states to 13109 states and 15754 transitions. [2025-03-16 14:12:05,459 INFO L78 Accepts]: Start accepts. Automaton has 13109 states and 15754 transitions. Word has length 237 [2025-03-16 14:12:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:05,459 INFO L471 AbstractCegarLoop]: Abstraction has 13109 states and 15754 transitions. [2025-03-16 14:12:05,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 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-03-16 14:12:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 13109 states and 15754 transitions. [2025-03-16 14:12:05,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-16 14:12:05,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:05,467 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:05,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 14:12:05,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:05,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1073414401, now seen corresponding path program 2 times [2025-03-16 14:12:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:05,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779205535] [2025-03-16 14:12:05,470 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:12:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:05,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 244 statements into 2 equivalence classes. [2025-03-16 14:12:05,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 14:12:05,523 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:12:05,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:05,877 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 82 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:12:05,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:05,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779205535] [2025-03-16 14:12:05,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779205535] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:05,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782530357] [2025-03-16 14:12:05,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 14:12:05,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:05,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:05,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:05,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 14:12:05,963 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 244 statements into 2 equivalence classes. [2025-03-16 14:12:06,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 244 of 244 statements. [2025-03-16 14:12:06,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 14:12:06,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:06,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:06,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 14:12:06,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:06,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782530357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:06,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:06,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-16 14:12:06,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823343742] [2025-03-16 14:12:06,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:06,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:06,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:06,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:06,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:06,244 INFO L87 Difference]: Start difference. First operand 13109 states and 15754 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-03-16 14:12:06,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:06,971 INFO L93 Difference]: Finished difference Result 36781 states and 44229 transitions. [2025-03-16 14:12:06,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:06,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 244 [2025-03-16 14:12:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:07,008 INFO L225 Difference]: With dead ends: 36781 [2025-03-16 14:12:07,008 INFO L226 Difference]: Without dead ends: 23673 [2025-03-16 14:12:07,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:12:07,024 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 152 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:07,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 148 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23673 states. [2025-03-16 14:12:07,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23673 to 23669. [2025-03-16 14:12:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23669 states, 23668 states have (on average 1.1640189285110698) internal successors, (27550), 23668 states have internal predecessors, (27550), 0 states have call successors, (0), 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-03-16 14:12:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23669 states to 23669 states and 27550 transitions. [2025-03-16 14:12:07,286 INFO L78 Accepts]: Start accepts. Automaton has 23669 states and 27550 transitions. Word has length 244 [2025-03-16 14:12:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:07,286 INFO L471 AbstractCegarLoop]: Abstraction has 23669 states and 27550 transitions. [2025-03-16 14:12:07,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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-03-16 14:12:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 23669 states and 27550 transitions. [2025-03-16 14:12:07,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-16 14:12:07,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:07,298 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:12:07,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 14:12:07,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:07,498 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:07,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:07,499 INFO L85 PathProgramCache]: Analyzing trace with hash -855795985, now seen corresponding path program 1 times [2025-03-16 14:12:07,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435294918] [2025-03-16 14:12:07,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:07,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 14:12:07,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 14:12:07,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:07,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-16 14:12:08,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435294918] [2025-03-16 14:12:08,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435294918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774954206] [2025-03-16 14:12:08,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:08,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:08,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:08,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:08,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 14:12:08,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-16 14:12:08,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-16 14:12:08,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:08,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:08,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:08,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-16 14:12:08,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:08,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774954206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:08,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:08,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:12:08,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052256704] [2025-03-16 14:12:08,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:08,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:08,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:08,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:08,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:08,489 INFO L87 Difference]: Start difference. First operand 23669 states and 27550 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-03-16 14:12:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:09,160 INFO L93 Difference]: Finished difference Result 68515 states and 79727 transitions. [2025-03-16 14:12:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:09,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 246 [2025-03-16 14:12:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:09,208 INFO L225 Difference]: With dead ends: 68515 [2025-03-16 14:12:09,208 INFO L226 Difference]: Without dead ends: 44847 [2025-03-16 14:12:09,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:09,224 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:09,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 126 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44847 states. [2025-03-16 14:12:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44847 to 39120. [2025-03-16 14:12:09,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39120 states, 39119 states have (on average 1.171936910452721) internal successors, (45845), 39119 states have internal predecessors, (45845), 0 states have call successors, (0), 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-03-16 14:12:09,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39120 states to 39120 states and 45845 transitions. [2025-03-16 14:12:09,681 INFO L78 Accepts]: Start accepts. Automaton has 39120 states and 45845 transitions. Word has length 246 [2025-03-16 14:12:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 39120 states and 45845 transitions. [2025-03-16 14:12:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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-03-16 14:12:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 39120 states and 45845 transitions. [2025-03-16 14:12:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-03-16 14:12:09,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:09,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 14:12:09,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 14:12:09,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:09,898 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:09,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash 647366965, now seen corresponding path program 1 times [2025-03-16 14:12:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891624454] [2025-03-16 14:12:09,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:09,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-03-16 14:12:10,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-03-16 14:12:10,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:10,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:10,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:10,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891624454] [2025-03-16 14:12:10,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891624454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:10,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:10,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:10,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382494255] [2025-03-16 14:12:10,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:10,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:10,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:10,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:10,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:10,123 INFO L87 Difference]: Start difference. First operand 39120 states and 45845 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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-03-16 14:12:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:10,922 INFO L93 Difference]: Finished difference Result 97735 states and 115269 transitions. [2025-03-16 14:12:10,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:10,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 277 [2025-03-16 14:12:10,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:11,013 INFO L225 Difference]: With dead ends: 97735 [2025-03-16 14:12:11,013 INFO L226 Difference]: Without dead ends: 58616 [2025-03-16 14:12:11,049 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-03-16 14:12:11,050 INFO L435 NwaCegarLoop]: 309 mSDtfsCounter, 240 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:11,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 324 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58616 states. [2025-03-16 14:12:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58616 to 58610. [2025-03-16 14:12:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58610 states, 58609 states have (on average 1.1505570816768755) internal successors, (67433), 58609 states have internal predecessors, (67433), 0 states have call successors, (0), 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-03-16 14:12:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58610 states to 58610 states and 67433 transitions. [2025-03-16 14:12:11,716 INFO L78 Accepts]: Start accepts. Automaton has 58610 states and 67433 transitions. Word has length 277 [2025-03-16 14:12:11,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:11,717 INFO L471 AbstractCegarLoop]: Abstraction has 58610 states and 67433 transitions. [2025-03-16 14:12:11,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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-03-16 14:12:11,717 INFO L276 IsEmpty]: Start isEmpty. Operand 58610 states and 67433 transitions. [2025-03-16 14:12:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-16 14:12:11,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:11,742 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 14:12:11,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:12:11,742 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:11,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1440383979, now seen corresponding path program 1 times [2025-03-16 14:12:11,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:11,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66712684] [2025-03-16 14:12:11,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:11,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:11,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-16 14:12:11,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-16 14:12:11,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:11,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-16 14:12:11,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66712684] [2025-03-16 14:12:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66712684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:11,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:11,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:11,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753108265] [2025-03-16 14:12:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:11,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:11,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:11,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:11,872 INFO L87 Difference]: Start difference. First operand 58610 states and 67433 transitions. Second operand has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-03-16 14:12:12,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:12,750 INFO L93 Difference]: Finished difference Result 143213 states and 164750 transitions. [2025-03-16 14:12:12,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 316 [2025-03-16 14:12:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:12,841 INFO L225 Difference]: With dead ends: 143213 [2025-03-16 14:12:12,841 INFO L226 Difference]: Without dead ends: 84604 [2025-03-16 14:12:12,864 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-03-16 14:12:12,864 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 224 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:12,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 303 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:12,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84604 states. [2025-03-16 14:12:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84604 to 74034. [2025-03-16 14:12:13,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74034 states, 74033 states have (on average 1.1205678548755285) internal successors, (82959), 74033 states have internal predecessors, (82959), 0 states have call successors, (0), 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-03-16 14:12:13,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74034 states to 74034 states and 82959 transitions. [2025-03-16 14:12:13,783 INFO L78 Accepts]: Start accepts. Automaton has 74034 states and 82959 transitions. Word has length 316 [2025-03-16 14:12:13,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:13,784 INFO L471 AbstractCegarLoop]: Abstraction has 74034 states and 82959 transitions. [2025-03-16 14:12:13,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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-03-16 14:12:13,784 INFO L276 IsEmpty]: Start isEmpty. Operand 74034 states and 82959 transitions. [2025-03-16 14:12:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2025-03-16 14:12:13,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:13,805 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:12:13,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 14:12:13,805 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:13,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1096616430, now seen corresponding path program 1 times [2025-03-16 14:12:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948017073] [2025-03-16 14:12:13,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:13,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-03-16 14:12:13,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-03-16 14:12:13,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:13,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 14:12:13,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:13,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948017073] [2025-03-16 14:12:13,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948017073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:13,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:13,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:13,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70958443] [2025-03-16 14:12:13,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:13,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:13,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:13,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:13,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:13,947 INFO L87 Difference]: Start difference. First operand 74034 states and 82959 transitions. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-03-16 14:12:14,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:14,810 INFO L93 Difference]: Finished difference Result 139534 states and 155767 transitions. [2025-03-16 14:12:14,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:14,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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 323 [2025-03-16 14:12:14,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:14,890 INFO L225 Difference]: With dead ends: 139534 [2025-03-16 14:12:14,890 INFO L226 Difference]: Without dead ends: 65501 [2025-03-16 14:12:14,937 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-03-16 14:12:14,938 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 225 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:14,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 320 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:12:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65501 states. [2025-03-16 14:12:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65501 to 65487. [2025-03-16 14:12:15,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65487 states, 65486 states have (on average 1.097349051705708) internal successors, (71861), 65486 states have internal predecessors, (71861), 0 states have call successors, (0), 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-03-16 14:12:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65487 states to 65487 states and 71861 transitions. [2025-03-16 14:12:15,888 INFO L78 Accepts]: Start accepts. Automaton has 65487 states and 71861 transitions. Word has length 323 [2025-03-16 14:12:15,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:15,889 INFO L471 AbstractCegarLoop]: Abstraction has 65487 states and 71861 transitions. [2025-03-16 14:12:15,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 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-03-16 14:12:15,889 INFO L276 IsEmpty]: Start isEmpty. Operand 65487 states and 71861 transitions. [2025-03-16 14:12:15,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 14:12:15,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:15,908 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:12:15,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:12:15,909 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:15,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:15,909 INFO L85 PathProgramCache]: Analyzing trace with hash -543691404, now seen corresponding path program 1 times [2025-03-16 14:12:15,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:15,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535418687] [2025-03-16 14:12:15,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:15,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 14:12:15,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 14:12:15,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:15,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 14:12:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:16,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535418687] [2025-03-16 14:12:16,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535418687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:16,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:16,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:16,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265177251] [2025-03-16 14:12:16,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:16,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:16,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:16,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:16,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:12:16,285 INFO L87 Difference]: Start difference. First operand 65487 states and 71861 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-03-16 14:12:16,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:16,972 INFO L93 Difference]: Finished difference Result 136070 states and 149282 transitions. [2025-03-16 14:12:16,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:16,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 348 [2025-03-16 14:12:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:17,051 INFO L225 Difference]: With dead ends: 136070 [2025-03-16 14:12:17,051 INFO L226 Difference]: Without dead ends: 70584 [2025-03-16 14:12:17,093 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-03-16 14:12:17,094 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 85 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:17,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 347 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70584 states. [2025-03-16 14:12:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70584 to 60006. [2025-03-16 14:12:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60006 states, 60005 states have (on average 1.097658528455962) internal successors, (65865), 60005 states have internal predecessors, (65865), 0 states have call successors, (0), 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-03-16 14:12:18,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60006 states to 60006 states and 65865 transitions. [2025-03-16 14:12:18,023 INFO L78 Accepts]: Start accepts. Automaton has 60006 states and 65865 transitions. Word has length 348 [2025-03-16 14:12:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:18,023 INFO L471 AbstractCegarLoop]: Abstraction has 60006 states and 65865 transitions. [2025-03-16 14:12:18,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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-03-16 14:12:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 60006 states and 65865 transitions. [2025-03-16 14:12:18,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-16 14:12:18,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:18,043 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 14:12:18,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:12:18,043 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:18,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:18,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1650210524, now seen corresponding path program 1 times [2025-03-16 14:12:18,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:18,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599775003] [2025-03-16 14:12:18,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:18,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:18,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-16 14:12:18,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-16 14:12:18,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:18,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 14:12:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599775003] [2025-03-16 14:12:18,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599775003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:18,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:18,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:18,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170930384] [2025-03-16 14:12:18,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:18,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:12:18,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:18,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:12:18,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:18,423 INFO L87 Difference]: Start difference. First operand 60006 states and 65865 transitions. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 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-03-16 14:12:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:19,403 INFO L93 Difference]: Finished difference Result 120249 states and 132000 transitions. [2025-03-16 14:12:19,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:12:19,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 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 364 [2025-03-16 14:12:19,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:19,480 INFO L225 Difference]: With dead ends: 120249 [2025-03-16 14:12:19,480 INFO L226 Difference]: Without dead ends: 60447 [2025-03-16 14:12:19,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:19,518 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 296 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:19,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 87 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:12:19,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60447 states. [2025-03-16 14:12:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60447 to 60006. [2025-03-16 14:12:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60006 states, 60005 states have (on average 1.097658528455962) internal successors, (65865), 60005 states have internal predecessors, (65865), 0 states have call successors, (0), 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-03-16 14:12:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60006 states to 60006 states and 65865 transitions. [2025-03-16 14:12:20,516 INFO L78 Accepts]: Start accepts. Automaton has 60006 states and 65865 transitions. Word has length 364 [2025-03-16 14:12:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:20,516 INFO L471 AbstractCegarLoop]: Abstraction has 60006 states and 65865 transitions. [2025-03-16 14:12:20,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 3 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-03-16 14:12:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 60006 states and 65865 transitions. [2025-03-16 14:12:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-03-16 14:12:20,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:20,543 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 14:12:20,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 14:12:20,544 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:20,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -958163609, now seen corresponding path program 1 times [2025-03-16 14:12:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215318926] [2025-03-16 14:12:20,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:20,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-16 14:12:20,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-16 14:12:20,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:20,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:21,733 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 110 proven. 6 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-16 14:12:21,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215318926] [2025-03-16 14:12:21,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215318926] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:21,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593747179] [2025-03-16 14:12:21,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:21,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:21,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:21,736 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:21,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 14:12:21,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-03-16 14:12:21,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-03-16 14:12:21,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:21,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:21,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:12:21,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-16 14:12:22,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:22,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593747179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:22,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:22,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 14:12:22,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615565788] [2025-03-16 14:12:22,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:22,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:22,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:22,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:22,073 INFO L87 Difference]: Start difference. First operand 60006 states and 65865 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 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-03-16 14:12:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:22,751 INFO L93 Difference]: Finished difference Result 151304 states and 166131 transitions. [2025-03-16 14:12:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:22,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 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 371 [2025-03-16 14:12:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:22,861 INFO L225 Difference]: With dead ends: 151304 [2025-03-16 14:12:22,862 INFO L226 Difference]: Without dead ends: 91502 [2025-03-16 14:12:22,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:22,914 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 192 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:22,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 437 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:12:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91502 states. [2025-03-16 14:12:24,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91502 to 91500. [2025-03-16 14:12:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91500 states, 91499 states have (on average 1.0978480639132668) internal successors, (100452), 91499 states have internal predecessors, (100452), 0 states have call successors, (0), 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-03-16 14:12:24,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91500 states to 91500 states and 100452 transitions. [2025-03-16 14:12:24,258 INFO L78 Accepts]: Start accepts. Automaton has 91500 states and 100452 transitions. Word has length 371 [2025-03-16 14:12:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:24,259 INFO L471 AbstractCegarLoop]: Abstraction has 91500 states and 100452 transitions. [2025-03-16 14:12:24,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 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-03-16 14:12:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 91500 states and 100452 transitions. [2025-03-16 14:12:24,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-03-16 14:12:24,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:24,283 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 14:12:24,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 14:12:24,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 14:12:24,483 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:24,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:24,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1918085044, now seen corresponding path program 1 times [2025-03-16 14:12:24,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:24,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793657991] [2025-03-16 14:12:24,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:24,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:24,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-16 14:12:24,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-16 14:12:24,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:24,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 447 proven. 18 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2025-03-16 14:12:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:24,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793657991] [2025-03-16 14:12:24,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793657991] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:24,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772010719] [2025-03-16 14:12:24,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:24,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:24,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:24,993 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:24,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 14:12:25,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-03-16 14:12:25,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-03-16 14:12:25,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:25,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:25,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:25,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-16 14:12:25,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:25,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772010719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:25,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:25,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-16 14:12:25,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499053916] [2025-03-16 14:12:25,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:25,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:25,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:25,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:25,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:25,314 INFO L87 Difference]: Start difference. First operand 91500 states and 100452 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 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-03-16 14:12:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:26,027 INFO L93 Difference]: Finished difference Result 263317 states and 289373 transitions. [2025-03-16 14:12:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 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 419 [2025-03-16 14:12:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:26,202 INFO L225 Difference]: With dead ends: 263317 [2025-03-16 14:12:26,203 INFO L226 Difference]: Without dead ends: 172021 [2025-03-16 14:12:26,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 419 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:26,277 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 198 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:26,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 528 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 14:12:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172021 states. [2025-03-16 14:12:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172021 to 172019. [2025-03-16 14:12:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172019 states, 172018 states have (on average 1.0992279877687219) internal successors, (189087), 172018 states have internal predecessors, (189087), 0 states have call successors, (0), 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-03-16 14:12:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172019 states to 172019 states and 189087 transitions. [2025-03-16 14:12:28,960 INFO L78 Accepts]: Start accepts. Automaton has 172019 states and 189087 transitions. Word has length 419 [2025-03-16 14:12:28,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:28,960 INFO L471 AbstractCegarLoop]: Abstraction has 172019 states and 189087 transitions. [2025-03-16 14:12:28,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 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-03-16 14:12:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 172019 states and 189087 transitions. [2025-03-16 14:12:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-03-16 14:12:29,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:29,000 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 14:12:29,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 14:12:29,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:29,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:29,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:29,201 INFO L85 PathProgramCache]: Analyzing trace with hash 846236361, now seen corresponding path program 1 times [2025-03-16 14:12:29,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:29,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604402025] [2025-03-16 14:12:29,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:29,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:29,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-16 14:12:29,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-16 14:12:29,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:29,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 286 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:12:29,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604402025] [2025-03-16 14:12:29,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604402025] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918724842] [2025-03-16 14:12:29,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:29,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:29,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:29,781 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:29,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 14:12:29,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-03-16 14:12:29,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-03-16 14:12:29,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:29,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:29,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:29,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2025-03-16 14:12:30,152 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:30,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918724842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:30,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:30,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:12:30,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841958404] [2025-03-16 14:12:30,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:30,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:30,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:30,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:30,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:30,154 INFO L87 Difference]: Start difference. First operand 172019 states and 189087 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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-03-16 14:12:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:31,422 INFO L93 Difference]: Finished difference Result 338178 states and 371983 transitions. [2025-03-16 14:12:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:31,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 424 [2025-03-16 14:12:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:31,641 INFO L225 Difference]: With dead ends: 338178 [2025-03-16 14:12:31,642 INFO L226 Difference]: Without dead ends: 166363 [2025-03-16 14:12:31,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:31,752 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 95 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:31,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 289 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:12:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166363 states. [2025-03-16 14:12:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166363 to 166335. [2025-03-16 14:12:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166335 states, 166334 states have (on average 1.0970998112232015) internal successors, (182485), 166334 states have internal predecessors, (182485), 0 states have call successors, (0), 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-03-16 14:12:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166335 states to 166335 states and 182485 transitions. [2025-03-16 14:12:34,256 INFO L78 Accepts]: Start accepts. Automaton has 166335 states and 182485 transitions. Word has length 424 [2025-03-16 14:12:34,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:34,257 INFO L471 AbstractCegarLoop]: Abstraction has 166335 states and 182485 transitions. [2025-03-16 14:12:34,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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-03-16 14:12:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand 166335 states and 182485 transitions. [2025-03-16 14:12:34,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-03-16 14:12:34,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:34,359 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 14:12:34,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 14:12:34,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:34,560 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:34,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash 823434421, now seen corresponding path program 1 times [2025-03-16 14:12:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:34,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942232002] [2025-03-16 14:12:34,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:34,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:34,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-16 14:12:34,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-16 14:12:34,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:34,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 218 proven. 6 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-03-16 14:12:36,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:36,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942232002] [2025-03-16 14:12:36,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942232002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:12:36,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033029666] [2025-03-16 14:12:36,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:36,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:12:36,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:12:36,545 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 14:12:36,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 14:12:36,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-03-16 14:12:36,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-03-16 14:12:36,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:36,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:36,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:12:36,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:12:36,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1119 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-16 14:12:36,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:12:36,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033029666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:36,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:12:36,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:12:36,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57853163] [2025-03-16 14:12:36,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:36,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:12:36,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:36,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:12:36,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:36,876 INFO L87 Difference]: Start difference. First operand 166335 states and 182485 transitions. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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-03-16 14:12:38,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:38,056 INFO L93 Difference]: Finished difference Result 343030 states and 375629 transitions. [2025-03-16 14:12:38,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:12:38,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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 607 [2025-03-16 14:12:38,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:38,297 INFO L225 Difference]: With dead ends: 343030 [2025-03-16 14:12:38,298 INFO L226 Difference]: Without dead ends: 176899 [2025-03-16 14:12:38,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:12:38,415 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 165 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:38,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 106 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:12:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176899 states. [2025-03-16 14:12:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176899 to 171808. [2025-03-16 14:12:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171808 states, 171807 states have (on average 1.085008177780882) internal successors, (186412), 171807 states have internal predecessors, (186412), 0 states have call successors, (0), 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-03-16 14:12:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171808 states to 171808 states and 186412 transitions. [2025-03-16 14:12:40,640 INFO L78 Accepts]: Start accepts. Automaton has 171808 states and 186412 transitions. Word has length 607 [2025-03-16 14:12:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:12:40,641 INFO L471 AbstractCegarLoop]: Abstraction has 171808 states and 186412 transitions. [2025-03-16 14:12:40,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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-03-16 14:12:40,641 INFO L276 IsEmpty]: Start isEmpty. Operand 171808 states and 186412 transitions. [2025-03-16 14:12:40,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-03-16 14:12:40,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:12:40,736 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-16 14:12:40,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 14:12:40,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-16 14:12:40,937 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:12:40,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:12:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash 435169328, now seen corresponding path program 1 times [2025-03-16 14:12:40,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:12:40,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103003829] [2025-03-16 14:12:40,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:12:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:12:40,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-03-16 14:12:41,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-03-16 14:12:41,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:12:41,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:12:41,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 827 trivial. 0 not checked. [2025-03-16 14:12:41,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:12:41,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103003829] [2025-03-16 14:12:41,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103003829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:12:41,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:12:41,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:12:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553714246] [2025-03-16 14:12:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:12:41,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:12:41,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:12:41,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:12:41,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:41,767 INFO L87 Difference]: Start difference. First operand 171808 states and 186412 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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-03-16 14:12:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:12:43,365 INFO L93 Difference]: Finished difference Result 358130 states and 388475 transitions. [2025-03-16 14:12:43,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:12:43,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 627 [2025-03-16 14:12:43,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:12:43,580 INFO L225 Difference]: With dead ends: 358130 [2025-03-16 14:12:43,580 INFO L226 Difference]: Without dead ends: 186526 [2025-03-16 14:12:43,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:12:43,669 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 346 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:12:43,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 112 Invalid, 1263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 14:12:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186526 states.