./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-97.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1168304632f0077b83496b9ac9fcc9f4b7202af110e2ee289e9a700c4c953dc1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:02:54,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:02:54,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:02:54,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:02:54,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:02:54,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:02:54,329 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:02:54,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:02:54,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:02:54,330 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:02:54,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:02:54,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:02:54,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:02:54,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:02:54,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:02:54,332 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:02:54,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:02:54,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:02:54,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:02:54,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:02:54,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:02:54,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:02:54,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:02:54,334 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1168304632f0077b83496b9ac9fcc9f4b7202af110e2ee289e9a700c4c953dc1 [2025-02-05 22:02:54,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:02:54,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:02:54,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:02:54,542 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:02:54,542 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:02:54,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-97.i [2025-02-05 22:02:55,671 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cca5a2e1/7b859519397c4110b5468dda4ac88506/FLAG677a4fa90 [2025-02-05 22:02:55,988 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:02:55,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-97.i [2025-02-05 22:02:56,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cca5a2e1/7b859519397c4110b5468dda4ac88506/FLAG677a4fa90 [2025-02-05 22:02:56,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cca5a2e1/7b859519397c4110b5468dda4ac88506 [2025-02-05 22:02:56,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:02:56,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:02:56,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:02:56,013 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:02:56,016 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:02:56,016 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60890542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56, skipping insertion in model container [2025-02-05 22:02:56,017 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,035 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:02:56,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-97.i[916,929] [2025-02-05 22:02:56,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:02:56,320 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:02:56,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-97.i[916,929] [2025-02-05 22:02:56,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:02:56,424 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:02:56,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56 WrapperNode [2025-02-05 22:02:56,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:02:56,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:02:56,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:02:56,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:02:56,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,445 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,518 INFO L138 Inliner]: procedures = 26, calls = 110, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 850 [2025-02-05 22:02:56,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:02:56,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:02:56,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:02:56,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:02:56,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,582 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 22:02:56,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:02:56,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:02:56,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:02:56,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:02:56,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (1/1) ... [2025-02-05 22:02:56,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:02:56,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:56,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:02:56,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:02:56,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:02:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:02:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:02:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:02:56,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:02:56,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:02:56,830 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:02:56,831 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:02:57,694 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc property_#t~ite81#1;havoc property_#t~ite80#1;havoc property_#t~bitwise79#1;havoc property_#t~short82#1;havoc property_#t~ite84#1;havoc property_#t~bitwise83#1;havoc property_#t~short85#1; [2025-02-05 22:02:57,844 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-02-05 22:02:57,845 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:02:57,870 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:02:57,870 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 22:02:57,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:57 BoogieIcfgContainer [2025-02-05 22:02:57,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:02:57,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:02:57,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:02:57,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:02:57,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:02:56" (1/3) ... [2025-02-05 22:02:57,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a75d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:57, skipping insertion in model container [2025-02-05 22:02:57,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:02:56" (2/3) ... [2025-02-05 22:02:57,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14a75d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:02:57, skipping insertion in model container [2025-02-05 22:02:57,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:02:57" (3/3) ... [2025-02-05 22:02:57,877 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-97.i [2025-02-05 22:02:57,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:02:57,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-97.i that has 2 procedures, 341 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:02:57,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:02:57,948 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;@297a80bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:02:57,949 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:02:57,953 INFO L276 IsEmpty]: Start isEmpty. Operand has 341 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 242 states have internal predecessors, (379), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 22:02:57,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-02-05 22:02:57,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:57,974 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:57,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:57,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:57,980 INFO L85 PathProgramCache]: Analyzing trace with hash 427300156, now seen corresponding path program 1 times [2025-02-05 22:02:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862140165] [2025-02-05 22:02:57,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:58,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-02-05 22:02:58,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-02-05 22:02:58,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:58,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2025-02-05 22:02:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862140165] [2025-02-05 22:02:58,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862140165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122271609] [2025-02-05 22:02:58,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:58,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:58,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:58,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:02:58,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:02:58,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-02-05 22:02:58,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-02-05 22:02:58,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:58,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:58,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:02:58,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:58,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 18432 trivial. 0 not checked. [2025-02-05 22:02:58,993 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:02:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122271609] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:58,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:02:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:02:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747343346] [2025-02-05 22:02:58,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:58,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:02:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:59,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:02:59,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:02:59,020 INFO L87 Difference]: Start difference. First operand has 341 states, 241 states have (on average 1.5726141078838174) internal successors, (379), 242 states have internal predecessors, (379), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) Second operand has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 2 states have call successors, (97) [2025-02-05 22:02:59,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:59,106 INFO L93 Difference]: Finished difference Result 676 states and 1238 transitions. [2025-02-05 22:02:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:02:59,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 2 states have call successors, (97) Word has length 630 [2025-02-05 22:02:59,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:59,120 INFO L225 Difference]: With dead ends: 676 [2025-02-05 22:02:59,120 INFO L226 Difference]: Without dead ends: 338 [2025-02-05 22:02:59,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 631 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-02-05 22:02:59,128 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:59,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 548 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:02:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-02-05 22:02:59,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-02-05 22:02:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 239 states have (on average 1.5564853556485356) internal successors, (372), 239 states have internal predecessors, (372), 97 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 97 states have call predecessors, (97), 97 states have call successors, (97) [2025-02-05 22:02:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 566 transitions. [2025-02-05 22:02:59,210 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 566 transitions. Word has length 630 [2025-02-05 22:02:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:59,212 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 566 transitions. [2025-02-05 22:02:59,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.0) internal successors, (150), 2 states have internal predecessors, (150), 2 states have call successors, (97), 2 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 2 states have call successors, (97) [2025-02-05 22:02:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 566 transitions. [2025-02-05 22:02:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-02-05 22:02:59,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:59,230 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:02:59,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:02:59,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:02:59,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:59,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:59,437 INFO L85 PathProgramCache]: Analyzing trace with hash 9864754, now seen corresponding path program 1 times [2025-02-05 22:02:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:59,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516868305] [2025-02-05 22:02:59,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:59,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-02-05 22:02:59,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-02-05 22:02:59,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:59,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:00,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:00,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516868305] [2025-02-05 22:03:00,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516868305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:00,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:00,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:00,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856525743] [2025-02-05 22:03:00,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:00,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:00,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:00,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:00,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:00,105 INFO L87 Difference]: Start difference. First operand 338 states and 566 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:00,216 INFO L93 Difference]: Finished difference Result 871 states and 1467 transitions. [2025-02-05 22:03:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:00,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 630 [2025-02-05 22:03:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:00,225 INFO L225 Difference]: With dead ends: 871 [2025-02-05 22:03:00,225 INFO L226 Difference]: Without dead ends: 536 [2025-02-05 22:03:00,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:00,227 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 344 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:00,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1391 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2025-02-05 22:03:00,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 533. [2025-02-05 22:03:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 417 states have (on average 1.6163069544364508) internal successors, (674), 418 states have internal predecessors, (674), 113 states have call successors, (113), 2 states have call predecessors, (113), 2 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-05 22:03:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 900 transitions. [2025-02-05 22:03:00,287 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 900 transitions. Word has length 630 [2025-02-05 22:03:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:00,288 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 900 transitions. [2025-02-05 22:03:00,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 900 transitions. [2025-02-05 22:03:00,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:00,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:00,294 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:00,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:03:00,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:00,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:00,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1596908953, now seen corresponding path program 1 times [2025-02-05 22:03:00,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:00,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35941895] [2025-02-05 22:03:00,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:00,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:00,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:00,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:00,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:00,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:00,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35941895] [2025-02-05 22:03:00,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35941895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:00,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:00,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:00,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436381810] [2025-02-05 22:03:00,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:00,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:00,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:00,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:00,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:00,613 INFO L87 Difference]: Start difference. First operand 533 states and 900 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:00,706 INFO L93 Difference]: Finished difference Result 1464 states and 2478 transitions. [2025-02-05 22:03:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:00,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:00,715 INFO L225 Difference]: With dead ends: 1464 [2025-02-05 22:03:00,716 INFO L226 Difference]: Without dead ends: 934 [2025-02-05 22:03:00,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:00,719 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 362 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:00,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 1198 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-02-05 22:03:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 931. [2025-02-05 22:03:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 931 states, 755 states have (on average 1.6304635761589403) internal successors, (1231), 758 states have internal predecessors, (1231), 171 states have call successors, (171), 4 states have call predecessors, (171), 4 states have return successors, (171), 168 states have call predecessors, (171), 171 states have call successors, (171) [2025-02-05 22:03:00,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1573 transitions. [2025-02-05 22:03:00,781 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1573 transitions. Word has length 631 [2025-02-05 22:03:00,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:00,785 INFO L471 AbstractCegarLoop]: Abstraction has 931 states and 1573 transitions. [2025-02-05 22:03:00,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:00,785 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1573 transitions. [2025-02-05 22:03:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:00,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:00,789 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:00,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:03:00,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:00,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:00,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1794207289, now seen corresponding path program 1 times [2025-02-05 22:03:00,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:00,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049204179] [2025-02-05 22:03:00,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:00,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:00,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:00,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:01,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049204179] [2025-02-05 22:03:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049204179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:01,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:01,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:01,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670010414] [2025-02-05 22:03:01,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:01,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:01,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:01,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:01,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:01,025 INFO L87 Difference]: Start difference. First operand 931 states and 1573 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:01,133 INFO L93 Difference]: Finished difference Result 1866 states and 3148 transitions. [2025-02-05 22:03:01,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:01,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:01,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:01,140 INFO L225 Difference]: With dead ends: 1866 [2025-02-05 22:03:01,140 INFO L226 Difference]: Without dead ends: 938 [2025-02-05 22:03:01,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:01,144 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 352 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:01,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1100 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:01,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-02-05 22:03:01,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 585. [2025-02-05 22:03:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 468 states have (on average 1.6175213675213675) internal successors, (757), 469 states have internal predecessors, (757), 113 states have call successors, (113), 3 states have call predecessors, (113), 3 states have return successors, (113), 112 states have call predecessors, (113), 113 states have call successors, (113) [2025-02-05 22:03:01,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 983 transitions. [2025-02-05 22:03:01,188 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 983 transitions. Word has length 631 [2025-02-05 22:03:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:01,189 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 983 transitions. [2025-02-05 22:03:01,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 983 transitions. [2025-02-05 22:03:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:01,193 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:01,194 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:01,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:03:01,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:01,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2074557178, now seen corresponding path program 1 times [2025-02-05 22:03:01,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:01,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763576077] [2025-02-05 22:03:01,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:01,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:01,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:01,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:01,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763576077] [2025-02-05 22:03:01,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763576077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:01,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:01,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:01,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017725860] [2025-02-05 22:03:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:01,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:01,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:01,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:01,392 INFO L87 Difference]: Start difference. First operand 585 states and 983 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:01,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:01,481 INFO L93 Difference]: Finished difference Result 1749 states and 2943 transitions. [2025-02-05 22:03:01,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:01,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:01,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:01,488 INFO L225 Difference]: With dead ends: 1749 [2025-02-05 22:03:01,489 INFO L226 Difference]: Without dead ends: 1167 [2025-02-05 22:03:01,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:01,491 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 556 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1420 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:01,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1420 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2025-02-05 22:03:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1165. [2025-02-05 22:03:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 932 states have (on average 1.611587982832618) internal successors, (1502), 934 states have internal predecessors, (1502), 226 states have call successors, (226), 6 states have call predecessors, (226), 6 states have return successors, (226), 224 states have call predecessors, (226), 226 states have call successors, (226) [2025-02-05 22:03:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1954 transitions. [2025-02-05 22:03:01,543 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1954 transitions. Word has length 631 [2025-02-05 22:03:01,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:01,544 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1954 transitions. [2025-02-05 22:03:01,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:01,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1954 transitions. [2025-02-05 22:03:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:01,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:01,568 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:01,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:03:01,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:01,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:01,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1589951493, now seen corresponding path program 1 times [2025-02-05 22:03:01,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:01,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53623065] [2025-02-05 22:03:01,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:01,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:01,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:01,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:01,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:01,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:01,788 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:01,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:01,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53623065] [2025-02-05 22:03:01,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53623065] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:01,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:01,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274136957] [2025-02-05 22:03:01,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:01,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:01,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:01,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:01,790 INFO L87 Difference]: Start difference. First operand 1165 states and 1954 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:01,915 INFO L93 Difference]: Finished difference Result 3067 states and 5128 transitions. [2025-02-05 22:03:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:01,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:01,925 INFO L225 Difference]: With dead ends: 3067 [2025-02-05 22:03:01,925 INFO L226 Difference]: Without dead ends: 1905 [2025-02-05 22:03:01,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:01,928 INFO L435 NwaCegarLoop]: 693 mSDtfsCounter, 322 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:01,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1222 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2025-02-05 22:03:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1901. [2025-02-05 22:03:02,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1514 states have (on average 1.5891677675033025) internal successors, (2406), 1520 states have internal predecessors, (2406), 374 states have call successors, (374), 12 states have call predecessors, (374), 12 states have return successors, (374), 368 states have call predecessors, (374), 374 states have call successors, (374) [2025-02-05 22:03:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 3154 transitions. [2025-02-05 22:03:02,016 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 3154 transitions. Word has length 631 [2025-02-05 22:03:02,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:02,016 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 3154 transitions. [2025-02-05 22:03:02,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 3154 transitions. [2025-02-05 22:03:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:02,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:02,022 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:02,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:03:02,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:02,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:02,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1180359547, now seen corresponding path program 1 times [2025-02-05 22:03:02,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:02,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908063106] [2025-02-05 22:03:02,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:02,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:02,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:02,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:02,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:02,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:02,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:02,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:02,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908063106] [2025-02-05 22:03:02,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908063106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:02,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:02,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:02,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433937226] [2025-02-05 22:03:02,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:02,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:02,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:02,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:02,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:02,214 INFO L87 Difference]: Start difference. First operand 1901 states and 3154 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:02,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:02,391 INFO L93 Difference]: Finished difference Result 5585 states and 9272 transitions. [2025-02-05 22:03:02,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:02,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:02,412 INFO L225 Difference]: With dead ends: 5585 [2025-02-05 22:03:02,412 INFO L226 Difference]: Without dead ends: 3687 [2025-02-05 22:03:02,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:02,419 INFO L435 NwaCegarLoop]: 1058 mSDtfsCounter, 551 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1571 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:02,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1571 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states. [2025-02-05 22:03:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 2069. [2025-02-05 22:03:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1682 states have (on average 1.5683709869203328) internal successors, (2638), 1688 states have internal predecessors, (2638), 374 states have call successors, (374), 12 states have call predecessors, (374), 12 states have return successors, (374), 368 states have call predecessors, (374), 374 states have call successors, (374) [2025-02-05 22:03:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 3386 transitions. [2025-02-05 22:03:02,589 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 3386 transitions. Word has length 631 [2025-02-05 22:03:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:02,590 INFO L471 AbstractCegarLoop]: Abstraction has 2069 states and 3386 transitions. [2025-02-05 22:03:02,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 3386 transitions. [2025-02-05 22:03:02,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:02,596 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:02,596 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:02,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:03:02,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:02,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:02,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1607055940, now seen corresponding path program 1 times [2025-02-05 22:03:02,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:02,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257362906] [2025-02-05 22:03:02,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:02,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:02,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:02,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:02,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:02,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:03,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:03,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257362906] [2025-02-05 22:03:03,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257362906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:03,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:03,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 22:03:03,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873142731] [2025-02-05 22:03:03,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:03,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 22:03:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:03,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 22:03:03,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-05 22:03:03,350 INFO L87 Difference]: Start difference. First operand 2069 states and 3386 transitions. Second operand has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:04,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:04,920 INFO L93 Difference]: Finished difference Result 8757 states and 14265 transitions. [2025-02-05 22:03:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:03:04,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:04,954 INFO L225 Difference]: With dead ends: 8757 [2025-02-05 22:03:04,955 INFO L226 Difference]: Without dead ends: 6691 [2025-02-05 22:03:04,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:03:04,964 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 2019 mSDsluCounter, 3016 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2019 SdHoareTripleChecker+Valid, 3613 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:04,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2019 Valid, 3613 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-05 22:03:04,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6691 states. [2025-02-05 22:03:05,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6691 to 5309. [2025-02-05 22:03:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 4546 states have (on average 1.5943686757589088) internal successors, (7248), 4568 states have internal predecessors, (7248), 730 states have call successors, (730), 32 states have call predecessors, (730), 32 states have return successors, (730), 708 states have call predecessors, (730), 730 states have call successors, (730) [2025-02-05 22:03:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 8708 transitions. [2025-02-05 22:03:05,230 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 8708 transitions. Word has length 631 [2025-02-05 22:03:05,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:05,231 INFO L471 AbstractCegarLoop]: Abstraction has 5309 states and 8708 transitions. [2025-02-05 22:03:05,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.9) internal successors, (149), 10 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:05,231 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 8708 transitions. [2025-02-05 22:03:05,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:05,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:05,240 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:05,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:03:05,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:05,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:05,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1663217435, now seen corresponding path program 1 times [2025-02-05 22:03:05,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:05,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020964009] [2025-02-05 22:03:05,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:05,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:05,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:05,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:05,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:05,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:05,723 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:05,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:05,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020964009] [2025-02-05 22:03:05,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020964009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:05,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:05,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:03:05,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592666382] [2025-02-05 22:03:05,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:05,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:03:05,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:05,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:03:05,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:03:05,726 INFO L87 Difference]: Start difference. First operand 5309 states and 8708 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:06,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:06,470 INFO L93 Difference]: Finished difference Result 10702 states and 17525 transitions. [2025-02-05 22:03:06,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:03:06,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:06,500 INFO L225 Difference]: With dead ends: 10702 [2025-02-05 22:03:06,500 INFO L226 Difference]: Without dead ends: 5396 [2025-02-05 22:03:06,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:03:06,513 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 992 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 2459 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:06,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 2459 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:03:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2025-02-05 22:03:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5384. [2025-02-05 22:03:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5384 states, 4582 states have (on average 1.5879528590135312) internal successors, (7276), 4605 states have internal predecessors, (7276), 763 states have call successors, (763), 38 states have call predecessors, (763), 38 states have return successors, (763), 740 states have call predecessors, (763), 763 states have call successors, (763) [2025-02-05 22:03:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 8802 transitions. [2025-02-05 22:03:06,746 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 8802 transitions. Word has length 631 [2025-02-05 22:03:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:06,746 INFO L471 AbstractCegarLoop]: Abstraction has 5384 states and 8802 transitions. [2025-02-05 22:03:06,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 8802 transitions. [2025-02-05 22:03:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:06,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:06,755 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:06,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:03:06,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:06,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash -998945862, now seen corresponding path program 1 times [2025-02-05 22:03:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144621918] [2025-02-05 22:03:06,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:06,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:06,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:06,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:06,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:07,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:07,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:07,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144621918] [2025-02-05 22:03:07,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144621918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:07,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:07,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:03:07,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878655131] [2025-02-05 22:03:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:07,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:03:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:07,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:03:07,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:03:07,339 INFO L87 Difference]: Start difference. First operand 5384 states and 8802 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:08,621 INFO L93 Difference]: Finished difference Result 12810 states and 20684 transitions. [2025-02-05 22:03:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 22:03:08,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:08,664 INFO L225 Difference]: With dead ends: 12810 [2025-02-05 22:03:08,664 INFO L226 Difference]: Without dead ends: 7488 [2025-02-05 22:03:08,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:03:08,676 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 1084 mSDsluCounter, 2191 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 2714 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:08,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 2714 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 22:03:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7488 states. [2025-02-05 22:03:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7488 to 6412. [2025-02-05 22:03:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6412 states, 5278 states have (on average 1.548313755210307) internal successors, (8172), 5309 states have internal predecessors, (8172), 1075 states have call successors, (1075), 58 states have call predecessors, (1075), 58 states have return successors, (1075), 1044 states have call predecessors, (1075), 1075 states have call successors, (1075) [2025-02-05 22:03:09,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6412 states to 6412 states and 10322 transitions. [2025-02-05 22:03:09,012 INFO L78 Accepts]: Start accepts. Automaton has 6412 states and 10322 transitions. Word has length 631 [2025-02-05 22:03:09,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:09,012 INFO L471 AbstractCegarLoop]: Abstraction has 6412 states and 10322 transitions. [2025-02-05 22:03:09,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 6412 states and 10322 transitions. [2025-02-05 22:03:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:09,024 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:09,024 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:09,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:03:09,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:09,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:09,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1407770087, now seen corresponding path program 1 times [2025-02-05 22:03:09,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:09,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744924772] [2025-02-05 22:03:09,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:09,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:09,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:09,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:09,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:09,405 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744924772] [2025-02-05 22:03:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744924772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:09,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:09,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:03:09,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524686077] [2025-02-05 22:03:09,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:09,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:03:09,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:09,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:03:09,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:03:09,408 INFO L87 Difference]: Start difference. First operand 6412 states and 10322 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:10,037 INFO L93 Difference]: Finished difference Result 15914 states and 25675 transitions. [2025-02-05 22:03:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:03:10,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:10,080 INFO L225 Difference]: With dead ends: 15914 [2025-02-05 22:03:10,080 INFO L226 Difference]: Without dead ends: 9564 [2025-02-05 22:03:10,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:03:10,101 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 697 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:10,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 1911 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:03:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9564 states. [2025-02-05 22:03:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9564 to 7086. [2025-02-05 22:03:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7086 states, 5952 states have (on average 1.5749327956989247) internal successors, (9374), 5983 states have internal predecessors, (9374), 1075 states have call successors, (1075), 58 states have call predecessors, (1075), 58 states have return successors, (1075), 1044 states have call predecessors, (1075), 1075 states have call successors, (1075) [2025-02-05 22:03:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7086 states to 7086 states and 11524 transitions. [2025-02-05 22:03:10,546 INFO L78 Accepts]: Start accepts. Automaton has 7086 states and 11524 transitions. Word has length 631 [2025-02-05 22:03:10,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:10,547 INFO L471 AbstractCegarLoop]: Abstraction has 7086 states and 11524 transitions. [2025-02-05 22:03:10,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 7086 states and 11524 transitions. [2025-02-05 22:03:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:10,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:10,557 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:10,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:03:10,558 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:10,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash -920286887, now seen corresponding path program 1 times [2025-02-05 22:03:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:10,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107739564] [2025-02-05 22:03:10,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:10,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:10,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:10,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:10,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:10,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:10,819 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:10,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:10,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107739564] [2025-02-05 22:03:10,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107739564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:10,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:10,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:10,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586852489] [2025-02-05 22:03:10,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:10,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:10,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:10,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:10,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:10,822 INFO L87 Difference]: Start difference. First operand 7086 states and 11524 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:11,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:11,101 INFO L93 Difference]: Finished difference Result 14158 states and 22991 transitions. [2025-02-05 22:03:11,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:11,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:11,123 INFO L225 Difference]: With dead ends: 14158 [2025-02-05 22:03:11,124 INFO L226 Difference]: Without dead ends: 7134 [2025-02-05 22:03:11,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:11,137 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 238 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:11,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 984 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:03:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7134 states. [2025-02-05 22:03:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7134 to 7134. [2025-02-05 22:03:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7134 states, 5988 states have (on average 1.568804275217101) internal successors, (9394), 6019 states have internal predecessors, (9394), 1075 states have call successors, (1075), 70 states have call predecessors, (1075), 70 states have return successors, (1075), 1044 states have call predecessors, (1075), 1075 states have call successors, (1075) [2025-02-05 22:03:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7134 states to 7134 states and 11544 transitions. [2025-02-05 22:03:11,455 INFO L78 Accepts]: Start accepts. Automaton has 7134 states and 11544 transitions. Word has length 631 [2025-02-05 22:03:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:11,455 INFO L471 AbstractCegarLoop]: Abstraction has 7134 states and 11544 transitions. [2025-02-05 22:03:11,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 7134 states and 11544 transitions. [2025-02-05 22:03:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:11,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:11,466 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:11,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:03:11,467 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:11,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:11,467 INFO L85 PathProgramCache]: Analyzing trace with hash 712517112, now seen corresponding path program 1 times [2025-02-05 22:03:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:11,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626851558] [2025-02-05 22:03:11,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:11,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:11,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:11,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:11,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:11,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:11,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626851558] [2025-02-05 22:03:11,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626851558] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:11,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:11,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:03:11,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516422732] [2025-02-05 22:03:11,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:11,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:03:11,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:11,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:03:11,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:03:11,806 INFO L87 Difference]: Start difference. First operand 7134 states and 11544 transitions. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 2 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-02-05 22:03:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:13,187 INFO L93 Difference]: Finished difference Result 26432 states and 42607 transitions. [2025-02-05 22:03:13,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:03:13,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 2 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) Word has length 631 [2025-02-05 22:03:13,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:13,245 INFO L225 Difference]: With dead ends: 26432 [2025-02-05 22:03:13,245 INFO L226 Difference]: Without dead ends: 19360 [2025-02-05 22:03:13,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:03:13,260 INFO L435 NwaCegarLoop]: 850 mSDtfsCounter, 944 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 3114 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:13,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 3114 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 22:03:13,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19360 states. [2025-02-05 22:03:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19360 to 17208. [2025-02-05 22:03:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17208 states, 14536 states have (on average 1.5709961474958722) internal successors, (22836), 14613 states have internal predecessors, (22836), 2509 states have call successors, (2509), 162 states have call predecessors, (2509), 162 states have return successors, (2509), 2432 states have call predecessors, (2509), 2509 states have call successors, (2509) [2025-02-05 22:03:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17208 states to 17208 states and 27854 transitions. [2025-02-05 22:03:14,289 INFO L78 Accepts]: Start accepts. Automaton has 17208 states and 27854 transitions. Word has length 631 [2025-02-05 22:03:14,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:14,290 INFO L471 AbstractCegarLoop]: Abstraction has 17208 states and 27854 transitions. [2025-02-05 22:03:14,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 2 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2025-02-05 22:03:14,290 INFO L276 IsEmpty]: Start isEmpty. Operand 17208 states and 27854 transitions. [2025-02-05 22:03:14,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:14,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:14,306 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:14,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:03:14,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:14,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash 145867932, now seen corresponding path program 1 times [2025-02-05 22:03:14,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:14,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253392119] [2025-02-05 22:03:14,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:14,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:14,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:14,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:14,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:14,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:14,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:14,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253392119] [2025-02-05 22:03:14,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253392119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:14,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:14,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:03:14,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243754612] [2025-02-05 22:03:14,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:14,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:03:14,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:14,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:03:14,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:03:14,530 INFO L87 Difference]: Start difference. First operand 17208 states and 27854 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:15,670 INFO L93 Difference]: Finished difference Result 50484 states and 81540 transitions. [2025-02-05 22:03:15,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:03:15,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:15,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:15,770 INFO L225 Difference]: With dead ends: 50484 [2025-02-05 22:03:15,770 INFO L226 Difference]: Without dead ends: 33338 [2025-02-05 22:03:15,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:03:15,801 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 543 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:15,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1426 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:03:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33338 states. [2025-02-05 22:03:16,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33338 to 17928. [2025-02-05 22:03:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17928 states, 15256 states have (on average 1.5865233350812795) internal successors, (24204), 15333 states have internal predecessors, (24204), 2509 states have call successors, (2509), 162 states have call predecessors, (2509), 162 states have return successors, (2509), 2432 states have call predecessors, (2509), 2509 states have call successors, (2509) [2025-02-05 22:03:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17928 states to 17928 states and 29222 transitions. [2025-02-05 22:03:16,642 INFO L78 Accepts]: Start accepts. Automaton has 17928 states and 29222 transitions. Word has length 631 [2025-02-05 22:03:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:16,645 INFO L471 AbstractCegarLoop]: Abstraction has 17928 states and 29222 transitions. [2025-02-05 22:03:16,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 17928 states and 29222 transitions. [2025-02-05 22:03:16,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:16,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:16,659 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:16,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:03:16,660 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:16,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:16,660 INFO L85 PathProgramCache]: Analyzing trace with hash -878825989, now seen corresponding path program 1 times [2025-02-05 22:03:16,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:16,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926178341] [2025-02-05 22:03:16,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:16,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:16,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:16,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:16,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:17,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:17,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926178341] [2025-02-05 22:03:17,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926178341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:17,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:17,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:03:17,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170029165] [2025-02-05 22:03:17,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:17,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:03:17,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:17,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:03:17,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:17,024 INFO L87 Difference]: Start difference. First operand 17928 states and 29222 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:18,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:18,088 INFO L93 Difference]: Finished difference Result 40431 states and 65832 transitions. [2025-02-05 22:03:18,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:03:18,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:18,162 INFO L225 Difference]: With dead ends: 40431 [2025-02-05 22:03:18,162 INFO L226 Difference]: Without dead ends: 22565 [2025-02-05 22:03:18,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:03:18,198 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 378 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 1236 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:18,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 1236 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:03:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22565 states. [2025-02-05 22:03:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22565 to 22563. [2025-02-05 22:03:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22563 states, 19026 states have (on average 1.5766845369494376) internal successors, (29998), 19125 states have internal predecessors, (29998), 3328 states have call successors, (3328), 208 states have call predecessors, (3328), 208 states have return successors, (3328), 3229 states have call predecessors, (3328), 3328 states have call successors, (3328) [2025-02-05 22:03:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22563 states to 22563 states and 36654 transitions. [2025-02-05 22:03:19,262 INFO L78 Accepts]: Start accepts. Automaton has 22563 states and 36654 transitions. Word has length 631 [2025-02-05 22:03:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:19,263 INFO L471 AbstractCegarLoop]: Abstraction has 22563 states and 36654 transitions. [2025-02-05 22:03:19,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 22563 states and 36654 transitions. [2025-02-05 22:03:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:19,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:19,274 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:19,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:03:19,274 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:19,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1408372647, now seen corresponding path program 1 times [2025-02-05 22:03:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285502054] [2025-02-05 22:03:19,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:19,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:19,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:19,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:19,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:19,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:19,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:19,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285502054] [2025-02-05 22:03:19,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285502054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:19,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:19,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:03:19,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072623827] [2025-02-05 22:03:19,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:19,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:03:19,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:19,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:03:19,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:03:19,567 INFO L87 Difference]: Start difference. First operand 22563 states and 36654 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:23,045 INFO L93 Difference]: Finished difference Result 112481 states and 180161 transitions. [2025-02-05 22:03:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:03:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:23,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:23,362 INFO L225 Difference]: With dead ends: 112481 [2025-02-05 22:03:23,362 INFO L226 Difference]: Without dead ends: 90003 [2025-02-05 22:03:23,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:03:23,418 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 1220 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:23,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 3010 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:03:23,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90003 states. [2025-02-05 22:03:26,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90003 to 77485. [2025-02-05 22:03:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77485 states, 65226 states have (on average 1.557691718026554) internal successors, (101602), 65631 states have internal predecessors, (101602), 11502 states have call successors, (11502), 756 states have call predecessors, (11502), 756 states have return successors, (11502), 11097 states have call predecessors, (11502), 11502 states have call successors, (11502) [2025-02-05 22:03:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77485 states to 77485 states and 124606 transitions. [2025-02-05 22:03:27,209 INFO L78 Accepts]: Start accepts. Automaton has 77485 states and 124606 transitions. Word has length 631 [2025-02-05 22:03:27,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:03:27,210 INFO L471 AbstractCegarLoop]: Abstraction has 77485 states and 124606 transitions. [2025-02-05 22:03:27,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 77485 states and 124606 transitions. [2025-02-05 22:03:27,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-05 22:03:27,246 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:03:27,246 INFO L218 NwaCegarLoop]: trace histogram [97, 97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:03:27,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 22:03:27,247 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:03:27,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:03:27,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1663109192, now seen corresponding path program 1 times [2025-02-05 22:03:27,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:03:27,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422020546] [2025-02-05 22:03:27,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:03:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:03:27,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-05 22:03:27,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-05 22:03:27,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:03:27,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:03:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 18624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18624 trivial. 0 not checked. [2025-02-05 22:03:27,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:03:27,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422020546] [2025-02-05 22:03:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422020546] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:03:27,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:03:27,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:03:27,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469194546] [2025-02-05 22:03:27,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:03:27,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:03:27,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:03:27,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:03:27,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:03:27,713 INFO L87 Difference]: Start difference. First operand 77485 states and 124606 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) [2025-02-05 22:03:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:03:35,066 INFO L93 Difference]: Finished difference Result 244959 states and 396869 transitions. [2025-02-05 22:03:35,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:03:35,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (97), 1 states have call predecessors, (97), 1 states have return successors, (97), 1 states have call predecessors, (97), 1 states have call successors, (97) Word has length 631 [2025-02-05 22:03:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:03:35,495 INFO L225 Difference]: With dead ends: 244959 [2025-02-05 22:03:35,495 INFO L226 Difference]: Without dead ends: 167559 [2025-02-05 22:03:35,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:03:35,637 INFO L435 NwaCegarLoop]: 1019 mSDtfsCounter, 682 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 2886 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:03:35,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 2886 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:03:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167559 states.