./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-3.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_fillercodestructure_filler-pe-co_file-3.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 4d296a3302a6844401d5af73ebf4532ddc45e3bc6fc59b524170709cbc547ff4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:43:10,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:43:10,206 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:43:10,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:43:10,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:43:10,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:43:10,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:43:10,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:43:10,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:43:10,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:43:10,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:43:10,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:43:10,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:43:10,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:43:10,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:43:10,244 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:43:10,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:43:10,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:43:10,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:43:10,245 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:43:10,245 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 -> 4d296a3302a6844401d5af73ebf4532ddc45e3bc6fc59b524170709cbc547ff4 [2025-02-05 22:43:10,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:43:10,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:43:10,506 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:43:10,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:43:10,507 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:43:10,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i [2025-02-05 22:43:11,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be9284f4/00a9a57dc7e64cc1b8dfb01dc152b0de/FLAGc277c1b6d [2025-02-05 22:43:12,053 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:43:12,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i [2025-02-05 22:43:12,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be9284f4/00a9a57dc7e64cc1b8dfb01dc152b0de/FLAGc277c1b6d [2025-02-05 22:43:12,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4be9284f4/00a9a57dc7e64cc1b8dfb01dc152b0de [2025-02-05 22:43:12,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:43:12,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:43:12,081 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:43:12,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:43:12,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:43:12,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190426d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12, skipping insertion in model container [2025-02-05 22:43:12,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:43:12,228 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_fillercodestructure_filler-pe-co_file-3.i[918,931] [2025-02-05 22:43:12,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:43:12,340 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:43:12,353 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_fillercodestructure_filler-pe-co_file-3.i[918,931] [2025-02-05 22:43:12,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:43:12,421 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:43:12,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12 WrapperNode [2025-02-05 22:43:12,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:43:12,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:43:12,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:43:12,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:43:12,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:43:12" (1/1) ... [2025-02-05 22:43:12,447 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:43:12" (1/1) ... [2025-02-05 22:43:12,497 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 271 [2025-02-05 22:43:12,497 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:43:12,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:43:12,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:43:12,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:43:12,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,533 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:43:12,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,550 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,566 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:43:12,568 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:43:12,568 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:43:12,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:43:12,569 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (1/1) ... [2025-02-05 22:43:12,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:43:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:43:12,600 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:43:12,602 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:43:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:43:12,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:43:12,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:43:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:43:12,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:43:12,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:43:12,703 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:43:12,704 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:43:13,145 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L198: havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2025-02-05 22:43:13,188 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-02-05 22:43:13,189 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:43:13,218 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:43:13,218 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 22:43:13,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:13 BoogieIcfgContainer [2025-02-05 22:43:13,220 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:43:13,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:43:13,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:43:13,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:43:13,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:43:12" (1/3) ... [2025-02-05 22:43:13,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106c840c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:43:13, skipping insertion in model container [2025-02-05 22:43:13,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:12" (2/3) ... [2025-02-05 22:43:13,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@106c840c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:43:13, skipping insertion in model container [2025-02-05 22:43:13,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:13" (3/3) ... [2025-02-05 22:43:13,230 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i [2025-02-05 22:43:13,245 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:43:13,247 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-3.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:43:13,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:43:13,318 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;@46498710, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:43:13,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:43:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 22:43:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 22:43:13,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:13,341 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:13,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:13,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash -858152115, now seen corresponding path program 1 times [2025-02-05 22:43:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:13,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984270806] [2025-02-05 22:43:13,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:13,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 22:43:13,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 22:43:13,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:13,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:13,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 22:43:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984270806] [2025-02-05 22:43:13,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984270806] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:43:13,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939349214] [2025-02-05 22:43:13,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:13,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:43:13,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:43:13,782 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:43:13,800 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:43:13,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 22:43:14,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 22:43:14,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:14,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:14,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:43:14,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:43:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-02-05 22:43:14,065 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:43:14,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939349214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:43:14,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:43:14,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:43:14,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12431086] [2025-02-05 22:43:14,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:43:14,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:43:14,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:14,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:43:14,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:43:14,096 INFO L87 Difference]: Start difference. First operand has 122 states, 85 states have (on average 1.5058823529411764) internal successors, (128), 86 states have internal predecessors, (128), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 22:43:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:14,139 INFO L93 Difference]: Finished difference Result 238 states and 421 transitions. [2025-02-05 22:43:14,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:43:14,141 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 221 [2025-02-05 22:43:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:14,147 INFO L225 Difference]: With dead ends: 238 [2025-02-05 22:43:14,148 INFO L226 Difference]: Without dead ends: 119 [2025-02-05 22:43:14,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 222 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:43:14,153 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:14,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:43:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-05 22:43:14,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-05 22:43:14,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 83 states have internal predecessors, (122), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-05 22:43:14,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 190 transitions. [2025-02-05 22:43:14,203 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 190 transitions. Word has length 221 [2025-02-05 22:43:14,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:14,203 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 190 transitions. [2025-02-05 22:43:14,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-02-05 22:43:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 190 transitions. [2025-02-05 22:43:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-02-05 22:43:14,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:14,212 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:14,222 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:43:14,413 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:43:14,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:14,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1725055729, now seen corresponding path program 1 times [2025-02-05 22:43:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130649421] [2025-02-05 22:43:14,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:14,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:14,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-02-05 22:43:14,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-02-05 22:43:14,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:14,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:43:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:14,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130649421] [2025-02-05 22:43:14,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130649421] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:43:14,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:43:14,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:43:14,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088126438] [2025-02-05 22:43:14,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:43:14,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:43:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:14,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:43:14,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:43:14,863 INFO L87 Difference]: Start difference. First operand 119 states and 190 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:15,080 INFO L93 Difference]: Finished difference Result 352 states and 566 transitions. [2025-02-05 22:43:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:43:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2025-02-05 22:43:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:15,086 INFO L225 Difference]: With dead ends: 352 [2025-02-05 22:43:15,088 INFO L226 Difference]: Without dead ends: 236 [2025-02-05 22:43:15,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:43:15,089 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 116 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:15,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 458 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:43:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-02-05 22:43:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 233. [2025-02-05 22:43:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 162 states have (on average 1.4753086419753085) internal successors, (239), 162 states have internal predecessors, (239), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 22:43:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 375 transitions. [2025-02-05 22:43:15,133 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 375 transitions. Word has length 221 [2025-02-05 22:43:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:15,134 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 375 transitions. [2025-02-05 22:43:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 375 transitions. [2025-02-05 22:43:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 22:43:15,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:15,137 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:15,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:43:15,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:15,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1583004866, now seen corresponding path program 1 times [2025-02-05 22:43:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:15,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720203581] [2025-02-05 22:43:15,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:15,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:15,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 22:43:15,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 22:43:15,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:15,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:43:15,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:15,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720203581] [2025-02-05 22:43:15,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720203581] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:43:15,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:43:15,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:43:15,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73860968] [2025-02-05 22:43:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:43:15,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:43:15,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:15,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:43:15,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:43:15,413 INFO L87 Difference]: Start difference. First operand 233 states and 375 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:15,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:15,533 INFO L93 Difference]: Finished difference Result 679 states and 1098 transitions. [2025-02-05 22:43:15,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:43:15,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2025-02-05 22:43:15,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:15,542 INFO L225 Difference]: With dead ends: 679 [2025-02-05 22:43:15,543 INFO L226 Difference]: Without dead ends: 449 [2025-02-05 22:43:15,544 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:43:15,544 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 179 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:15,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 340 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:43:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-05 22:43:15,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2025-02-05 22:43:15,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 306 states have (on average 1.4607843137254901) internal successors, (447), 306 states have internal predecessors, (447), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-05 22:43:15,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 719 transitions. [2025-02-05 22:43:15,613 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 719 transitions. Word has length 222 [2025-02-05 22:43:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:15,614 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 719 transitions. [2025-02-05 22:43:15,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 719 transitions. [2025-02-05 22:43:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 22:43:15,620 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:15,620 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:15,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:43:15,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:15,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:15,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1789759711, now seen corresponding path program 1 times [2025-02-05 22:43:15,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:15,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55327296] [2025-02-05 22:43:15,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:15,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:15,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 22:43:15,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 22:43:15,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:15,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:43:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:15,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55327296] [2025-02-05 22:43:15,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55327296] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:43:15,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:43:15,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:43:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150636403] [2025-02-05 22:43:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:43:15,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:43:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:15,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:43:15,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:43:15,906 INFO L87 Difference]: Start difference. First operand 447 states and 719 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:16,132 INFO L93 Difference]: Finished difference Result 895 states and 1440 transitions. [2025-02-05 22:43:16,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:43:16,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 222 [2025-02-05 22:43:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:16,141 INFO L225 Difference]: With dead ends: 895 [2025-02-05 22:43:16,142 INFO L226 Difference]: Without dead ends: 451 [2025-02-05 22:43:16,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:43:16,145 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 114 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:16,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 459 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:43:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-02-05 22:43:16,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2025-02-05 22:43:16,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 306 states have (on average 1.457516339869281) internal successors, (446), 306 states have internal predecessors, (446), 136 states have call successors, (136), 4 states have call predecessors, (136), 4 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-02-05 22:43:16,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 718 transitions. [2025-02-05 22:43:16,207 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 718 transitions. Word has length 222 [2025-02-05 22:43:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:16,208 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 718 transitions. [2025-02-05 22:43:16,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 718 transitions. [2025-02-05 22:43:16,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-02-05 22:43:16,212 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:16,212 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:16,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:43:16,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:16,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:16,213 INFO L85 PathProgramCache]: Analyzing trace with hash 949301820, now seen corresponding path program 1 times [2025-02-05 22:43:16,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:16,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127416595] [2025-02-05 22:43:16,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:16,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:16,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-02-05 22:43:16,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-02-05 22:43:16,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:16,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:16,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:43:16,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:16,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127416595] [2025-02-05 22:43:16,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127416595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:43:16,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:43:16,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:43:16,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771537041] [2025-02-05 22:43:16,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:43:16,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:43:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:16,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:43:16,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:43:16,503 INFO L87 Difference]: Start difference. First operand 447 states and 718 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:16,621 INFO L93 Difference]: Finished difference Result 1335 states and 2148 transitions. [2025-02-05 22:43:16,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:43:16,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 223 [2025-02-05 22:43:16,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:16,629 INFO L225 Difference]: With dead ends: 1335 [2025-02-05 22:43:16,629 INFO L226 Difference]: Without dead ends: 891 [2025-02-05 22:43:16,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:43:16,633 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 120 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:16,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 391 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:43:16,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2025-02-05 22:43:16,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 889. [2025-02-05 22:43:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 608 states have (on average 1.4407894736842106) internal successors, (876), 608 states have internal predecessors, (876), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-02-05 22:43:16,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1420 transitions. [2025-02-05 22:43:16,775 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1420 transitions. Word has length 223 [2025-02-05 22:43:16,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:16,775 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1420 transitions. [2025-02-05 22:43:16,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:16,776 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1420 transitions. [2025-02-05 22:43:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 22:43:16,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:16,780 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:16,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:43:16,781 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:16,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:16,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1322179193, now seen corresponding path program 1 times [2025-02-05 22:43:16,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944484001] [2025-02-05 22:43:16,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:16,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:16,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 22:43:16,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 22:43:16,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:16,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:43:16,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:16,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944484001] [2025-02-05 22:43:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944484001] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:43:16,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:43:16,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:43:16,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792218270] [2025-02-05 22:43:16,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:43:16,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:43:16,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:16,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:43:16,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:43:16,917 INFO L87 Difference]: Start difference. First operand 889 states and 1420 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:17,045 INFO L93 Difference]: Finished difference Result 2185 states and 3486 transitions. [2025-02-05 22:43:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:43:17,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-02-05 22:43:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:17,058 INFO L225 Difference]: With dead ends: 2185 [2025-02-05 22:43:17,058 INFO L226 Difference]: Without dead ends: 1299 [2025-02-05 22:43:17,061 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:43:17,062 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 83 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:17,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 417 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:43:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-02-05 22:43:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 961. [2025-02-05 22:43:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 680 states have (on average 1.4411764705882353) internal successors, (980), 680 states have internal predecessors, (980), 272 states have call successors, (272), 8 states have call predecessors, (272), 8 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-02-05 22:43:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1524 transitions. [2025-02-05 22:43:17,193 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1524 transitions. Word has length 224 [2025-02-05 22:43:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:17,194 INFO L471 AbstractCegarLoop]: Abstraction has 961 states and 1524 transitions. [2025-02-05 22:43:17,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1524 transitions. [2025-02-05 22:43:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 22:43:17,197 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:17,197 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:17,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:43:17,197 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:17,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:17,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1977122778, now seen corresponding path program 1 times [2025-02-05 22:43:17,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:17,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071753345] [2025-02-05 22:43:17,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:17,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:17,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 22:43:17,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 22:43:17,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:17,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:43:17,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:17,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071753345] [2025-02-05 22:43:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071753345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:43:17,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:43:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:43:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156037436] [2025-02-05 22:43:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:43:17,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:43:17,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:17,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:43:17,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:43:17,448 INFO L87 Difference]: Start difference. First operand 961 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:18,090 INFO L93 Difference]: Finished difference Result 3341 states and 5309 transitions. [2025-02-05 22:43:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:43:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 224 [2025-02-05 22:43:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:18,110 INFO L225 Difference]: With dead ends: 3341 [2025-02-05 22:43:18,111 INFO L226 Difference]: Without dead ends: 2383 [2025-02-05 22:43:18,116 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:43:18,116 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 420 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:18,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 452 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:43:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-02-05 22:43:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2379. [2025-02-05 22:43:18,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2379 states, 1678 states have (on average 1.4266984505363527) internal successors, (2394), 1678 states have internal predecessors, (2394), 680 states have call successors, (680), 20 states have call predecessors, (680), 20 states have return successors, (680), 680 states have call predecessors, (680), 680 states have call successors, (680) [2025-02-05 22:43:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2379 states to 2379 states and 3754 transitions. [2025-02-05 22:43:18,390 INFO L78 Accepts]: Start accepts. Automaton has 2379 states and 3754 transitions. Word has length 224 [2025-02-05 22:43:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:18,392 INFO L471 AbstractCegarLoop]: Abstraction has 2379 states and 3754 transitions. [2025-02-05 22:43:18,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2379 states and 3754 transitions. [2025-02-05 22:43:18,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-02-05 22:43:18,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:18,398 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:18,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:43:18,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:18,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1320772165, now seen corresponding path program 1 times [2025-02-05 22:43:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:18,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834982686] [2025-02-05 22:43:18,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:18,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 22:43:18,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 22:43:18,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:18,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-02-05 22:43:18,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834982686] [2025-02-05 22:43:18,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834982686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:43:18,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274573259] [2025-02-05 22:43:18,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:18,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:43:18,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:43:18,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:43:19,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:43:19,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-02-05 22:43:19,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-02-05 22:43:19,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:19,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:19,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 22:43:19,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:43:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1083 proven. 36 refuted. 0 times theorem prover too weak. 1125 trivial. 0 not checked. [2025-02-05 22:43:19,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:43:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-02-05 22:43:20,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274573259] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:43:20,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:43:20,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-02-05 22:43:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852956458] [2025-02-05 22:43:20,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:43:20,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:43:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:20,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:43:20,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:43:20,553 INFO L87 Difference]: Start difference. First operand 2379 states and 3754 transitions. Second operand has 14 states, 14 states have (on average 11.428571428571429) internal successors, (160), 14 states have internal predecessors, (160), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-02-05 22:43:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:23,494 INFO L93 Difference]: Finished difference Result 17689 states and 27890 transitions. [2025-02-05 22:43:23,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-05 22:43:23,495 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.428571428571429) internal successors, (160), 14 states have internal predecessors, (160), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) Word has length 224 [2025-02-05 22:43:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:23,605 INFO L225 Difference]: With dead ends: 17689 [2025-02-05 22:43:23,605 INFO L226 Difference]: Without dead ends: 15313 [2025-02-05 22:43:23,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=415, Unknown=0, NotChecked=0, Total=600 [2025-02-05 22:43:23,621 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 1089 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 2084 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:23,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 2084 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-02-05 22:43:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15313 states. [2025-02-05 22:43:24,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15313 to 8339. [2025-02-05 22:43:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8339 states, 5778 states have (on average 1.3970231914157147) internal successors, (8072), 5798 states have internal predecessors, (8072), 2460 states have call successors, (2460), 100 states have call predecessors, (2460), 100 states have return successors, (2460), 2440 states have call predecessors, (2460), 2460 states have call successors, (2460) [2025-02-05 22:43:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8339 states to 8339 states and 12992 transitions. [2025-02-05 22:43:25,021 INFO L78 Accepts]: Start accepts. Automaton has 8339 states and 12992 transitions. Word has length 224 [2025-02-05 22:43:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:25,022 INFO L471 AbstractCegarLoop]: Abstraction has 8339 states and 12992 transitions. [2025-02-05 22:43:25,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.428571428571429) internal successors, (160), 14 states have internal predecessors, (160), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2025-02-05 22:43:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 8339 states and 12992 transitions. [2025-02-05 22:43:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-02-05 22:43:25,029 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:25,029 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:25,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:43:25,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:43:25,231 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:25,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:25,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1561360952, now seen corresponding path program 1 times [2025-02-05 22:43:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28132220] [2025-02-05 22:43:25,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:25,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 22:43:25,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 22:43:25,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:25,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 75 proven. 117 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-02-05 22:43:26,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:26,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28132220] [2025-02-05 22:43:26,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28132220] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:43:26,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355544131] [2025-02-05 22:43:26,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:26,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:43:26,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:43:26,948 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:43:26,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:43:27,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-02-05 22:43:27,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-02-05 22:43:27,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:27,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:27,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 22:43:27,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:43:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1201 proven. 75 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-05 22:43:28,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:43:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 117 proven. 78 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2025-02-05 22:43:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355544131] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:43:29,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:43:29,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10] total 24 [2025-02-05 22:43:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403120887] [2025-02-05 22:43:29,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:43:29,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 22:43:29,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:29,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 22:43:29,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2025-02-05 22:43:29,284 INFO L87 Difference]: Start difference. First operand 8339 states and 12992 transitions. Second operand has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 9 states have call successors, (102), 4 states have call predecessors, (102), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-02-05 22:43:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:37,927 INFO L93 Difference]: Finished difference Result 34799 states and 51074 transitions. [2025-02-05 22:43:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-02-05 22:43:37,928 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 9 states have call successors, (102), 4 states have call predecessors, (102), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) Word has length 225 [2025-02-05 22:43:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:38,075 INFO L225 Difference]: With dead ends: 34799 [2025-02-05 22:43:38,075 INFO L226 Difference]: Without dead ends: 26463 [2025-02-05 22:43:38,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6607 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3408, Invalid=12594, Unknown=0, NotChecked=0, Total=16002 [2025-02-05 22:43:38,123 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 4669 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 1172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4673 SdHoareTripleChecker+Valid, 1732 SdHoareTripleChecker+Invalid, 3551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1172 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:38,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4673 Valid, 1732 Invalid, 3551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1172 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 22:43:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26463 states. [2025-02-05 22:43:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26463 to 20827. [2025-02-05 22:43:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20827 states, 15938 states have (on average 1.374450997615761) internal successors, (21906), 16138 states have internal predecessors, (21906), 4190 states have call successors, (4190), 698 states have call predecessors, (4190), 698 states have return successors, (4190), 3990 states have call predecessors, (4190), 4190 states have call successors, (4190) [2025-02-05 22:43:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20827 states to 20827 states and 30286 transitions. [2025-02-05 22:43:40,413 INFO L78 Accepts]: Start accepts. Automaton has 20827 states and 30286 transitions. Word has length 225 [2025-02-05 22:43:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:40,414 INFO L471 AbstractCegarLoop]: Abstraction has 20827 states and 30286 transitions. [2025-02-05 22:43:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.083333333333333) internal successors, (170), 24 states have internal predecessors, (170), 9 states have call successors, (102), 4 states have call predecessors, (102), 9 states have return successors, (102), 9 states have call predecessors, (102), 9 states have call successors, (102) [2025-02-05 22:43:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 20827 states and 30286 transitions. [2025-02-05 22:43:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-05 22:43:40,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:40,424 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:40,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 22:43:40,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:43:40,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:40,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:40,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1111368125, now seen corresponding path program 1 times [2025-02-05 22:43:40,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:40,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272897060] [2025-02-05 22:43:40,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:40,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:40,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 22:43:40,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 22:43:40,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:40,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:43:40,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:40,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272897060] [2025-02-05 22:43:40,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272897060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:43:40,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:43:40,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:43:40,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470117798] [2025-02-05 22:43:40,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:43:40,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:43:40,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:40,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:43:40,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:43:40,908 INFO L87 Difference]: Start difference. First operand 20827 states and 30286 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:43,592 INFO L93 Difference]: Finished difference Result 45015 states and 65598 transitions. [2025-02-05 22:43:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:43:43,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 226 [2025-02-05 22:43:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:43,759 INFO L225 Difference]: With dead ends: 45015 [2025-02-05 22:43:43,760 INFO L226 Difference]: Without dead ends: 34489 [2025-02-05 22:43:43,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:43:43,801 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 187 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:43,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 833 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:43:43,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34489 states. [2025-02-05 22:43:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34489 to 34459. [2025-02-05 22:43:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34459 states, 26030 states have (on average 1.3682289665770264) internal successors, (35615), 26382 states have internal predecessors, (35615), 7230 states have call successors, (7230), 1198 states have call predecessors, (7230), 1198 states have return successors, (7230), 6878 states have call predecessors, (7230), 7230 states have call successors, (7230) [2025-02-05 22:43:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34459 states to 34459 states and 50075 transitions. [2025-02-05 22:43:47,579 INFO L78 Accepts]: Start accepts. Automaton has 34459 states and 50075 transitions. Word has length 226 [2025-02-05 22:43:47,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:47,581 INFO L471 AbstractCegarLoop]: Abstraction has 34459 states and 50075 transitions. [2025-02-05 22:43:47,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:43:47,581 INFO L276 IsEmpty]: Start isEmpty. Operand 34459 states and 50075 transitions. [2025-02-05 22:43:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-02-05 22:43:47,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:47,589 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:47,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:43:47,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:47,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1901597500, now seen corresponding path program 1 times [2025-02-05 22:43:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788612710] [2025-02-05 22:43:47,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:47,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:47,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 22:43:47,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 22:43:47,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:47,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 57 proven. 135 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-02-05 22:43:48,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788612710] [2025-02-05 22:43:48,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788612710] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:43:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898059937] [2025-02-05 22:43:48,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:48,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:43:48,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:43:48,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:43:48,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 22:43:48,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-02-05 22:43:49,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-02-05 22:43:49,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:49,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:49,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 22:43:49,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:43:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1256 proven. 192 refuted. 0 times theorem prover too weak. 796 trivial. 0 not checked. [2025-02-05 22:43:49,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:43:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 87 proven. 201 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2025-02-05 22:43:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898059937] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:43:50,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:43:50,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 25 [2025-02-05 22:43:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211553749] [2025-02-05 22:43:50,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:43:50,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 22:43:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:50,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 22:43:50,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2025-02-05 22:43:50,898 INFO L87 Difference]: Start difference. First operand 34459 states and 50075 transitions. Second operand has 25 states, 25 states have (on average 5.48) internal successors, (137), 25 states have internal predecessors, (137), 9 states have call successors, (88), 4 states have call predecessors, (88), 10 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) [2025-02-05 22:43:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:43:53,534 INFO L93 Difference]: Finished difference Result 56218 states and 80557 transitions. [2025-02-05 22:43:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 22:43:53,534 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.48) internal successors, (137), 25 states have internal predecessors, (137), 9 states have call successors, (88), 4 states have call predecessors, (88), 10 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) Word has length 226 [2025-02-05 22:43:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:43:53,679 INFO L225 Difference]: With dead ends: 56218 [2025-02-05 22:43:53,680 INFO L226 Difference]: Without dead ends: 21762 [2025-02-05 22:43:53,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=619, Invalid=1361, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 22:43:53,771 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1184 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:43:53,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 482 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:43:53,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21762 states. [2025-02-05 22:43:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21762 to 20113. [2025-02-05 22:43:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20113 states, 15232 states have (on average 1.34046743697479) internal successors, (20418), 15438 states have internal predecessors, (20418), 3990 states have call successors, (3990), 890 states have call predecessors, (3990), 890 states have return successors, (3990), 3784 states have call predecessors, (3990), 3990 states have call successors, (3990) [2025-02-05 22:43:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20113 states to 20113 states and 28398 transitions. [2025-02-05 22:43:55,857 INFO L78 Accepts]: Start accepts. Automaton has 20113 states and 28398 transitions. Word has length 226 [2025-02-05 22:43:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:43:55,857 INFO L471 AbstractCegarLoop]: Abstraction has 20113 states and 28398 transitions. [2025-02-05 22:43:55,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.48) internal successors, (137), 25 states have internal predecessors, (137), 9 states have call successors, (88), 4 states have call predecessors, (88), 10 states have return successors, (89), 9 states have call predecessors, (89), 9 states have call successors, (89) [2025-02-05 22:43:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 20113 states and 28398 transitions. [2025-02-05 22:43:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-02-05 22:43:55,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:43:55,863 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:55,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 22:43:56,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 22:43:56,064 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:43:56,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:43:56,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1800109767, now seen corresponding path program 1 times [2025-02-05 22:43:56,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:43:56,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926508603] [2025-02-05 22:43:56,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:43:56,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:43:56,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-05 22:43:56,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-05 22:43:56,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:43:56,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:43:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:43:56,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:43:56,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926508603] [2025-02-05 22:43:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926508603] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:43:56,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:43:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:43:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239872678] [2025-02-05 22:43:56,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:43:56,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:43:56,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:43:56,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:43:56,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:43:56,254 INFO L87 Difference]: Start difference. First operand 20113 states and 28398 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:44:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:44:00,196 INFO L93 Difference]: Finished difference Result 50679 states and 71619 transitions. [2025-02-05 22:44:00,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:44:00,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 227 [2025-02-05 22:44:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:44:00,367 INFO L225 Difference]: With dead ends: 50679 [2025-02-05 22:44:00,368 INFO L226 Difference]: Without dead ends: 30569 [2025-02-05 22:44:00,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:44:00,435 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 312 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:44:00,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 695 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:44:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30569 states. [2025-02-05 22:44:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30569 to 26847. [2025-02-05 22:44:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26847 states, 20094 states have (on average 1.3259679506320294) internal successors, (26644), 20336 states have internal predecessors, (26644), 5506 states have call successors, (5506), 1246 states have call predecessors, (5506), 1246 states have return successors, (5506), 5264 states have call predecessors, (5506), 5506 states have call successors, (5506) [2025-02-05 22:44:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26847 states to 26847 states and 37656 transitions. [2025-02-05 22:44:03,282 INFO L78 Accepts]: Start accepts. Automaton has 26847 states and 37656 transitions. Word has length 227 [2025-02-05 22:44:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:44:03,283 INFO L471 AbstractCegarLoop]: Abstraction has 26847 states and 37656 transitions. [2025-02-05 22:44:03,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:44:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 26847 states and 37656 transitions. [2025-02-05 22:44:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 22:44:03,287 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:44:03,287 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:03,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:44:03,288 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:44:03,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:44:03,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1098556127, now seen corresponding path program 1 times [2025-02-05 22:44:03,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:44:03,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696744294] [2025-02-05 22:44:03,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:44:03,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:44:03,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 22:44:03,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 22:44:03,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:44:03,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:44:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:44:03,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:44:03,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696744294] [2025-02-05 22:44:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696744294] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:44:03,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:44:03,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:44:03,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068845441] [2025-02-05 22:44:03,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:44:03,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:44:03,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:44:03,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:44:03,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:44:03,418 INFO L87 Difference]: Start difference. First operand 26847 states and 37656 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:44:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:44:07,285 INFO L93 Difference]: Finished difference Result 68938 states and 96807 transitions. [2025-02-05 22:44:07,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:44:07,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-02-05 22:44:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:44:07,506 INFO L225 Difference]: With dead ends: 68938 [2025-02-05 22:44:07,506 INFO L226 Difference]: Without dead ends: 50070 [2025-02-05 22:44:07,572 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:44:07,575 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 110 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:44:07,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 379 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:44:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50070 states. [2025-02-05 22:44:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50070 to 50068. [2025-02-05 22:44:12,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50068 states, 37489 states have (on average 1.3245218597455253) internal successors, (49655), 37953 states have internal predecessors, (49655), 10258 states have call successors, (10258), 2320 states have call predecessors, (10258), 2320 states have return successors, (10258), 9794 states have call predecessors, (10258), 10258 states have call successors, (10258) [2025-02-05 22:44:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50068 states to 50068 states and 70171 transitions. [2025-02-05 22:44:12,782 INFO L78 Accepts]: Start accepts. Automaton has 50068 states and 70171 transitions. Word has length 228 [2025-02-05 22:44:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:44:12,783 INFO L471 AbstractCegarLoop]: Abstraction has 50068 states and 70171 transitions. [2025-02-05 22:44:12,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:44:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 50068 states and 70171 transitions. [2025-02-05 22:44:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-02-05 22:44:12,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:44:12,792 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:12,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:44:12,792 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:44:12,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:44:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1472672902, now seen corresponding path program 1 times [2025-02-05 22:44:12,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:44:12,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459399118] [2025-02-05 22:44:12,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:44:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:44:12,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-02-05 22:44:12,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-02-05 22:44:12,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:44:12,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:44:13,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-02-05 22:44:13,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:44:13,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459399118] [2025-02-05 22:44:13,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459399118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:44:13,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:44:13,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:44:13,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859309907] [2025-02-05 22:44:13,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:44:13,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:44:13,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:44:13,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:44:13,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:44:13,035 INFO L87 Difference]: Start difference. First operand 50068 states and 70171 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-02-05 22:44:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:44:19,372 INFO L93 Difference]: Finished difference Result 96411 states and 135266 transitions. [2025-02-05 22:44:19,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:44:19,373 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 228 [2025-02-05 22:44:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:44:19,656 INFO L225 Difference]: With dead ends: 96411 [2025-02-05 22:44:19,656 INFO L226 Difference]: Without dead ends: 65327 [2025-02-05 22:44:19,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:44:19,745 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 473 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:44:19,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 574 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:44:19,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65327 states.