./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.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-ps-co_file-81.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 efef9fe37e22accb878733580a57fa075eb75a906afbc039a6b0766829c26689 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:04:24,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:04:24,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:04:24,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:04:24,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:04:24,330 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:04:24,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:04:24,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:04:24,331 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:04:24,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:04:24,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:04:24,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:04:24,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:04:24,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:04:24,333 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:04:24,334 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:04:24,334 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:04:24,334 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:04:24,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:04:24,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:04:24,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:04:24,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:04:24,335 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:04:24,335 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:04:24,335 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:04:24,335 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:04:24,335 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:04:24,335 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:04:24,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:04:24,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:04:24,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:04:24,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:04:24,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:04:24,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:04:24,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:04:24,336 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:04:24,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:04:24,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:04:24,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:04:24,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:04:24,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:04:24,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:04:24,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:04:24,337 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 -> efef9fe37e22accb878733580a57fa075eb75a906afbc039a6b0766829c26689 [2025-02-06 00:04:24,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:04:24,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:04:24,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:04:24,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:04:24,636 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:04:24,637 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-ps-co_file-81.i [2025-02-06 00:04:25,905 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053467135/99b3e048462e466bbf4b85fd56ec32f7/FLAG681f349a7 [2025-02-06 00:04:26,195 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:04:26,196 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i [2025-02-06 00:04:26,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053467135/99b3e048462e466bbf4b85fd56ec32f7/FLAG681f349a7 [2025-02-06 00:04:26,218 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/053467135/99b3e048462e466bbf4b85fd56ec32f7 [2025-02-06 00:04:26,220 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:04:26,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:04:26,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:04:26,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:04:26,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:04:26,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d271e62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26, skipping insertion in model container [2025-02-06 00:04:26,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:04:26,360 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-ps-co_file-81.i[919,932] [2025-02-06 00:04:26,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:04:26,455 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:04:26,465 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-ps-co_file-81.i[919,932] [2025-02-06 00:04:26,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:04:26,539 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:04:26,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26 WrapperNode [2025-02-06 00:04:26,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:04:26,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:04:26,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:04:26,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:04:26,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,626 INFO L138 Inliner]: procedures = 26, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 299 [2025-02-06 00:04:26,628 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:04:26,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:04:26,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:04:26,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:04:26,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,683 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-06 00:04:26,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:04:26,719 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:04:26,720 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:04:26,720 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:04:26,721 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (1/1) ... [2025-02-06 00:04:26,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:04:26,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:04:26,752 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-06 00:04:26,755 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-06 00:04:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:04:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:04:26,770 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:04:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:04:26,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:04:26,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:04:26,853 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:04:26,854 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:04:27,389 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L220: havoc property_#t~bitwise33#1;havoc property_#t~short34#1; [2025-02-06 00:04:27,452 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-06 00:04:27,453 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:04:27,477 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:04:27,480 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:04:27,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:27 BoogieIcfgContainer [2025-02-06 00:04:27,481 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:04:27,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:04:27,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:04:27,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:04:27,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:04:26" (1/3) ... [2025-02-06 00:04:27,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439fc373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:27, skipping insertion in model container [2025-02-06 00:04:27,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:04:26" (2/3) ... [2025-02-06 00:04:27,491 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@439fc373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:04:27, skipping insertion in model container [2025-02-06 00:04:27,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:04:27" (3/3) ... [2025-02-06 00:04:27,492 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i [2025-02-06 00:04:27,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:04:27,513 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-81.i that has 2 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:04:27,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:04:27,591 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;@4b1e2b61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:04:27,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:04:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 00:04:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-06 00:04:27,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:04:27,619 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:04:27,619 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:04:27,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:04:27,624 INFO L85 PathProgramCache]: Analyzing trace with hash 971413070, now seen corresponding path program 1 times [2025-02-06 00:04:27,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:04:27,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564872996] [2025-02-06 00:04:27,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:04:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:04:27,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-06 00:04:27,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-06 00:04:27,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:04:27,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:04:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-02-06 00:04:28,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:04:28,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564872996] [2025-02-06 00:04:28,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564872996] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:04:28,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898195806] [2025-02-06 00:04:28,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:04:28,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:04:28,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:04:28,171 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-06 00:04:28,172 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-06 00:04:28,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-06 00:04:28,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-06 00:04:28,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:04:28,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:04:28,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:04:28,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:04:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2025-02-06 00:04:28,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:04:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898195806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:04:28,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:04:28,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:04:28,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828270486] [2025-02-06 00:04:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:04:28,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:04:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:04:28,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:04:28,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:04:28,503 INFO L87 Difference]: Start difference. First operand has 130 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 80 states have internal predecessors, (112), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 00:04:28,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:04:28,548 INFO L93 Difference]: Finished difference Result 254 states and 459 transitions. [2025-02-06 00:04:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:04:28,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 295 [2025-02-06 00:04:28,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:04:28,558 INFO L225 Difference]: With dead ends: 254 [2025-02-06 00:04:28,558 INFO L226 Difference]: Without dead ends: 127 [2025-02-06 00:04:28,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 296 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-06 00:04:28,564 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:04:28,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:04:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-02-06 00:04:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-02-06 00:04:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 48 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 00:04:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 203 transitions. [2025-02-06 00:04:28,621 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 203 transitions. Word has length 295 [2025-02-06 00:04:28,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:04:28,621 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 203 transitions. [2025-02-06 00:04:28,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (48), 2 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 00:04:28,621 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 203 transitions. [2025-02-06 00:04:28,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-02-06 00:04:28,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:04:28,630 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:04:28,640 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-06 00:04:28,830 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-06 00:04:28,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:04:28,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:04:28,832 INFO L85 PathProgramCache]: Analyzing trace with hash -179814710, now seen corresponding path program 1 times [2025-02-06 00:04:28,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:04:28,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352066476] [2025-02-06 00:04:28,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:04:28,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:04:28,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-02-06 00:04:28,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-02-06 00:04:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:04:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:04:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:04:29,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:04:29,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352066476] [2025-02-06 00:04:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352066476] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:04:29,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:04:29,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:04:29,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953069602] [2025-02-06 00:04:29,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:04:29,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:04:29,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:04:29,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:04:29,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:04:29,371 INFO L87 Difference]: Start difference. First operand 127 states and 203 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:04:29,463 INFO L93 Difference]: Finished difference Result 358 states and 579 transitions. [2025-02-06 00:04:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:04:29,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 295 [2025-02-06 00:04:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:04:29,472 INFO L225 Difference]: With dead ends: 358 [2025-02-06 00:04:29,472 INFO L226 Difference]: Without dead ends: 234 [2025-02-06 00:04:29,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:04:29,474 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 92 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:04:29,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 382 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:04:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-02-06 00:04:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 219. [2025-02-06 00:04:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 120 states have (on average 1.325) internal successors, (159), 120 states have internal predecessors, (159), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 00:04:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 351 transitions. [2025-02-06 00:04:29,532 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 351 transitions. Word has length 295 [2025-02-06 00:04:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:04:29,535 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 351 transitions. [2025-02-06 00:04:29,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:29,535 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 351 transitions. [2025-02-06 00:04:29,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-02-06 00:04:29,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:04:29,542 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:04:29,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:04:29,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:04:29,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:04:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash 849300518, now seen corresponding path program 1 times [2025-02-06 00:04:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:04:29,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141147736] [2025-02-06 00:04:29,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:04:29,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:04:29,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-06 00:04:29,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-06 00:04:29,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:04:29,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:04:30,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:04:30,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:04:30,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141147736] [2025-02-06 00:04:30,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141147736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:04:30,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:04:30,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:04:30,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38339879] [2025-02-06 00:04:30,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:04:30,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:04:30,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:04:30,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:04:30,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:04:30,319 INFO L87 Difference]: Start difference. First operand 219 states and 351 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:04:30,630 INFO L93 Difference]: Finished difference Result 357 states and 575 transitions. [2025-02-06 00:04:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:04:30,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 296 [2025-02-06 00:04:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:04:30,634 INFO L225 Difference]: With dead ends: 357 [2025-02-06 00:04:30,634 INFO L226 Difference]: Without dead ends: 230 [2025-02-06 00:04:30,637 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-06 00:04:30,638 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 85 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:04:30,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 442 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:04:30,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-06 00:04:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 220. [2025-02-06 00:04:30,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 121 states have (on average 1.322314049586777) internal successors, (160), 121 states have internal predecessors, (160), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 00:04:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 352 transitions. [2025-02-06 00:04:30,689 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 352 transitions. Word has length 296 [2025-02-06 00:04:30,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:04:30,690 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 352 transitions. [2025-02-06 00:04:30,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:30,690 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 352 transitions. [2025-02-06 00:04:30,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 00:04:30,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:04:30,694 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:04:30,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:04:30,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:04:30,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:04:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1050365645, now seen corresponding path program 1 times [2025-02-06 00:04:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:04:30,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339020551] [2025-02-06 00:04:30,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:04:30,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:04:30,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 00:04:30,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 00:04:30,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:04:30,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:04:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:04:44,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:04:44,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339020551] [2025-02-06 00:04:44,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339020551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:04:44,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:04:44,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 00:04:44,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503044933] [2025-02-06 00:04:44,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:04:44,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 00:04:44,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:04:44,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 00:04:44,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:04:44,470 INFO L87 Difference]: Start difference. First operand 220 states and 352 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:46,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:04:46,695 INFO L93 Difference]: Finished difference Result 428 states and 671 transitions. [2025-02-06 00:04:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 00:04:46,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-02-06 00:04:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:04:46,700 INFO L225 Difference]: With dead ends: 428 [2025-02-06 00:04:46,700 INFO L226 Difference]: Without dead ends: 304 [2025-02-06 00:04:46,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-02-06 00:04:46,703 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 259 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:04:46,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 1235 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 00:04:46,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-02-06 00:04:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 233. [2025-02-06 00:04:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 96 states have call successors, (96), 2 states have call predecessors, (96), 2 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 00:04:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 372 transitions. [2025-02-06 00:04:46,750 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 372 transitions. Word has length 297 [2025-02-06 00:04:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:04:46,750 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 372 transitions. [2025-02-06 00:04:46,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 372 transitions. [2025-02-06 00:04:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 00:04:46,754 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:04:46,756 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:04:46,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:04:46,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:04:46,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:04:46,757 INFO L85 PathProgramCache]: Analyzing trace with hash 853852140, now seen corresponding path program 1 times [2025-02-06 00:04:46,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:04:46,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038318626] [2025-02-06 00:04:46,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:04:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:04:46,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 00:04:46,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 00:04:46,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:04:46,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:04:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:04:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:04:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038318626] [2025-02-06 00:04:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038318626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:04:47,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:04:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:04:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046615503] [2025-02-06 00:04:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:04:47,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:04:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:04:47,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:04:47,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:04:47,127 INFO L87 Difference]: Start difference. First operand 233 states and 372 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:04:47,214 INFO L93 Difference]: Finished difference Result 402 states and 636 transitions. [2025-02-06 00:04:47,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:04:47,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-02-06 00:04:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:04:47,219 INFO L225 Difference]: With dead ends: 402 [2025-02-06 00:04:47,219 INFO L226 Difference]: Without dead ends: 265 [2025-02-06 00:04:47,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:04:47,224 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 42 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:04:47,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 587 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:04:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-06 00:04:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2025-02-06 00:04:47,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 158 states have (on average 1.3354430379746836) internal successors, (211), 159 states have internal predecessors, (211), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:04:47,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 411 transitions. [2025-02-06 00:04:47,266 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 411 transitions. Word has length 297 [2025-02-06 00:04:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:04:47,269 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 411 transitions. [2025-02-06 00:04:47,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 411 transitions. [2025-02-06 00:04:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 00:04:47,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:04:47,273 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:04:47,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:04:47,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:04:47,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:04:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash -746585714, now seen corresponding path program 1 times [2025-02-06 00:04:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:04:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885520885] [2025-02-06 00:04:47,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:04:47,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:04:47,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 00:04:47,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 00:04:47,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:04:47,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:04:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:04:53,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:04:53,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885520885] [2025-02-06 00:04:53,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885520885] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:04:53,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:04:53,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:04:53,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812904440] [2025-02-06 00:04:53,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:04:53,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:04:53,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:04:53,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:04:53,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:04:53,947 INFO L87 Difference]: Start difference. First operand 262 states and 411 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:04:56,951 INFO L93 Difference]: Finished difference Result 565 states and 863 transitions. [2025-02-06 00:04:56,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:04:56,952 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-02-06 00:04:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:04:56,956 INFO L225 Difference]: With dead ends: 565 [2025-02-06 00:04:56,956 INFO L226 Difference]: Without dead ends: 399 [2025-02-06 00:04:56,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-02-06 00:04:56,958 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 468 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 00:04:56,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 989 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 00:04:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-02-06 00:04:56,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 274. [2025-02-06 00:04:56,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 170 states have (on average 1.3647058823529412) internal successors, (232), 171 states have internal predecessors, (232), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:04:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 432 transitions. [2025-02-06 00:04:56,991 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 432 transitions. Word has length 297 [2025-02-06 00:04:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:04:56,991 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 432 transitions. [2025-02-06 00:04:56,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 432 transitions. [2025-02-06 00:04:56,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 00:04:56,996 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:04:56,996 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:04:56,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:04:56,996 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:04:56,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:04:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1179448364, now seen corresponding path program 1 times [2025-02-06 00:04:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:04:56,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046556635] [2025-02-06 00:04:56,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:04:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:04:57,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 00:04:57,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 00:04:57,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:04:57,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:04:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:04:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:04:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046556635] [2025-02-06 00:04:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046556635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:04:57,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:04:57,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 00:04:57,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593945570] [2025-02-06 00:04:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:04:57,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 00:04:57,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:04:57,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 00:04:57,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:04:57,758 INFO L87 Difference]: Start difference. First operand 274 states and 432 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:04:58,511 INFO L93 Difference]: Finished difference Result 495 states and 770 transitions. [2025-02-06 00:04:58,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 00:04:58,512 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-02-06 00:04:58,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:04:58,516 INFO L225 Difference]: With dead ends: 495 [2025-02-06 00:04:58,517 INFO L226 Difference]: Without dead ends: 329 [2025-02-06 00:04:58,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:04:58,518 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 169 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:04:58,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 796 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 00:04:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-02-06 00:04:58,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 280. [2025-02-06 00:04:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 176 states have (on average 1.3579545454545454) internal successors, (239), 177 states have internal predecessors, (239), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:04:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 439 transitions. [2025-02-06 00:04:58,556 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 439 transitions. Word has length 297 [2025-02-06 00:04:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:04:58,556 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 439 transitions. [2025-02-06 00:04:58,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:04:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 439 transitions. [2025-02-06 00:04:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 00:04:58,558 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:04:58,558 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:04:58,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:04:58,559 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:04:58,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:04:58,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1252144339, now seen corresponding path program 1 times [2025-02-06 00:04:58,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:04:58,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019431702] [2025-02-06 00:04:58,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:04:58,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:04:58,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 00:04:58,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 00:04:58,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:04:58,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:05:06,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:06,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019431702] [2025-02-06 00:05:06,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019431702] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:06,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:06,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:05:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794005417] [2025-02-06 00:05:06,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:06,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:05:06,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:05:06,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:05:06,026 INFO L87 Difference]: Start difference. First operand 280 states and 439 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:07,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:07,327 INFO L93 Difference]: Finished difference Result 514 states and 792 transitions. [2025-02-06 00:05:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 00:05:07,329 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 297 [2025-02-06 00:05:07,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:07,332 INFO L225 Difference]: With dead ends: 514 [2025-02-06 00:05:07,333 INFO L226 Difference]: Without dead ends: 348 [2025-02-06 00:05:07,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-02-06 00:05:07,336 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 228 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:07,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 901 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 00:05:07,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-02-06 00:05:07,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 278. [2025-02-06 00:05:07,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 175 states have internal predecessors, (237), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:05:07,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 437 transitions. [2025-02-06 00:05:07,375 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 437 transitions. Word has length 297 [2025-02-06 00:05:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:07,376 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 437 transitions. [2025-02-06 00:05:07,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 437 transitions. [2025-02-06 00:05:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 00:05:07,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:07,378 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:05:07,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 00:05:07,379 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:07,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:07,379 INFO L85 PathProgramCache]: Analyzing trace with hash -2085948190, now seen corresponding path program 1 times [2025-02-06 00:05:07,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:07,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014584556] [2025-02-06 00:05:07,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:07,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:07,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 00:05:07,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 00:05:07,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:07,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:11,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:05:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014584556] [2025-02-06 00:05:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014584556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:11,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 00:05:11,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096719017] [2025-02-06 00:05:11,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 00:05:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:11,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 00:05:11,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:05:11,937 INFO L87 Difference]: Start difference. First operand 278 states and 437 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:12,524 INFO L93 Difference]: Finished difference Result 586 states and 894 transitions. [2025-02-06 00:05:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 00:05:12,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-02-06 00:05:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:12,529 INFO L225 Difference]: With dead ends: 586 [2025-02-06 00:05:12,529 INFO L226 Difference]: Without dead ends: 420 [2025-02-06 00:05:12,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:05:12,530 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 199 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:12,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 872 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 00:05:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-02-06 00:05:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 286. [2025-02-06 00:05:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 182 states have (on average 1.3736263736263736) internal successors, (250), 183 states have internal predecessors, (250), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:05:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 450 transitions. [2025-02-06 00:05:12,565 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 450 transitions. Word has length 298 [2025-02-06 00:05:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:12,565 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 450 transitions. [2025-02-06 00:05:12,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 450 transitions. [2025-02-06 00:05:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 00:05:12,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:12,568 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:05:12,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 00:05:12,568 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:12,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:12,569 INFO L85 PathProgramCache]: Analyzing trace with hash 2012505601, now seen corresponding path program 1 times [2025-02-06 00:05:12,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:12,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667913996] [2025-02-06 00:05:12,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:12,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 00:05:12,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 00:05:12,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:12,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:05:17,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667913996] [2025-02-06 00:05:17,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667913996] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:17,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:17,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:05:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468051214] [2025-02-06 00:05:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:17,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:05:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:17,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:05:17,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:05:17,445 INFO L87 Difference]: Start difference. First operand 286 states and 450 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:19,265 INFO L93 Difference]: Finished difference Result 581 states and 890 transitions. [2025-02-06 00:05:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:05:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-02-06 00:05:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:19,270 INFO L225 Difference]: With dead ends: 581 [2025-02-06 00:05:19,270 INFO L226 Difference]: Without dead ends: 410 [2025-02-06 00:05:19,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2025-02-06 00:05:19,273 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 323 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:19,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 982 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 00:05:19,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-02-06 00:05:19,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 296. [2025-02-06 00:05:19,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 192 states have (on average 1.3802083333333333) internal successors, (265), 193 states have internal predecessors, (265), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:05:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 465 transitions. [2025-02-06 00:05:19,316 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 465 transitions. Word has length 298 [2025-02-06 00:05:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:19,317 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 465 transitions. [2025-02-06 00:05:19,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 465 transitions. [2025-02-06 00:05:19,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 00:05:19,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:19,320 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:05:19,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 00:05:19,320 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:19,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash 412067747, now seen corresponding path program 1 times [2025-02-06 00:05:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:19,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545479755] [2025-02-06 00:05:19,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:19,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 00:05:19,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 00:05:19,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:19,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:23,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:05:23,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:23,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545479755] [2025-02-06 00:05:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545479755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:23,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:05:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923201740] [2025-02-06 00:05:23,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:23,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:05:23,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:23,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:05:23,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:05:23,936 INFO L87 Difference]: Start difference. First operand 296 states and 465 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:25,195 INFO L93 Difference]: Finished difference Result 625 states and 952 transitions. [2025-02-06 00:05:25,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:05:25,196 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-02-06 00:05:25,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:25,200 INFO L225 Difference]: With dead ends: 625 [2025-02-06 00:05:25,200 INFO L226 Difference]: Without dead ends: 454 [2025-02-06 00:05:25,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-02-06 00:05:25,204 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 462 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:25,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1003 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 00:05:25,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-02-06 00:05:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 299. [2025-02-06 00:05:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 195 states have (on average 1.3794871794871795) internal successors, (269), 196 states have internal predecessors, (269), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:05:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 469 transitions. [2025-02-06 00:05:25,246 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 469 transitions. Word has length 298 [2025-02-06 00:05:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:25,247 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 469 transitions. [2025-02-06 00:05:25,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 469 transitions. [2025-02-06 00:05:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 00:05:25,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:25,250 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:05:25,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 00:05:25,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:25,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash 215554242, now seen corresponding path program 1 times [2025-02-06 00:05:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:25,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902152134] [2025-02-06 00:05:25,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:25,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 00:05:25,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 00:05:25,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:25,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:05:30,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:30,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902152134] [2025-02-06 00:05:30,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902152134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:30,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:30,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 00:05:30,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385294740] [2025-02-06 00:05:30,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:30,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 00:05:30,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:30,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 00:05:30,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 00:05:30,060 INFO L87 Difference]: Start difference. First operand 299 states and 469 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 00:05:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:32,011 INFO L93 Difference]: Finished difference Result 566 states and 870 transitions. [2025-02-06 00:05:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 00:05:32,012 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) Word has length 298 [2025-02-06 00:05:32,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:32,015 INFO L225 Difference]: With dead ends: 566 [2025-02-06 00:05:32,015 INFO L226 Difference]: Without dead ends: 395 [2025-02-06 00:05:32,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2025-02-06 00:05:32,017 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 404 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:32,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 935 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 00:05:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-02-06 00:05:32,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 300. [2025-02-06 00:05:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 196 states have (on average 1.3826530612244898) internal successors, (271), 197 states have internal predecessors, (271), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:05:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 471 transitions. [2025-02-06 00:05:32,053 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 471 transitions. Word has length 298 [2025-02-06 00:05:32,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:32,054 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 471 transitions. [2025-02-06 00:05:32,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 00:05:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 471 transitions. [2025-02-06 00:05:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 00:05:32,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:32,056 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:05:32,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 00:05:32,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:32,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash -93490878, now seen corresponding path program 1 times [2025-02-06 00:05:32,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:32,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41979736] [2025-02-06 00:05:32,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:32,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 00:05:32,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 00:05:32,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:32,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:05:37,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:37,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41979736] [2025-02-06 00:05:37,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41979736] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:37,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:37,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 00:05:37,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865212312] [2025-02-06 00:05:37,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:37,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 00:05:37,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:37,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 00:05:37,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 00:05:37,111 INFO L87 Difference]: Start difference. First operand 300 states and 471 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:38,606 INFO L93 Difference]: Finished difference Result 548 states and 843 transitions. [2025-02-06 00:05:38,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 00:05:38,607 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-02-06 00:05:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:38,611 INFO L225 Difference]: With dead ends: 548 [2025-02-06 00:05:38,611 INFO L226 Difference]: Without dead ends: 377 [2025-02-06 00:05:38,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-06 00:05:38,613 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 279 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:38,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 927 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 00:05:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-02-06 00:05:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 296. [2025-02-06 00:05:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 192 states have (on average 1.3802083333333333) internal successors, (265), 193 states have internal predecessors, (265), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-06 00:05:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 465 transitions. [2025-02-06 00:05:38,649 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 465 transitions. Word has length 298 [2025-02-06 00:05:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:38,650 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 465 transitions. [2025-02-06 00:05:38,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 465 transitions. [2025-02-06 00:05:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 00:05:38,652 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:38,652 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:05:38,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 00:05:38,653 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:38,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:38,653 INFO L85 PathProgramCache]: Analyzing trace with hash -578396381, now seen corresponding path program 1 times [2025-02-06 00:05:38,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:38,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4176769] [2025-02-06 00:05:38,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:38,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:38,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 00:05:38,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 00:05:38,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:38,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:05:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4512 trivial. 0 not checked. [2025-02-06 00:05:38,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:05:38,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4176769] [2025-02-06 00:05:38,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4176769] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:05:38,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:05:38,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:05:38,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526678418] [2025-02-06 00:05:38,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:05:38,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:05:38,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:05:38,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:05:38,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:05:38,864 INFO L87 Difference]: Start difference. First operand 296 states and 465 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:05:38,956 INFO L93 Difference]: Finished difference Result 494 states and 765 transitions. [2025-02-06 00:05:38,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:05:38,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) Word has length 298 [2025-02-06 00:05:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:05:38,960 INFO L225 Difference]: With dead ends: 494 [2025-02-06 00:05:38,960 INFO L226 Difference]: Without dead ends: 323 [2025-02-06 00:05:38,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:05:38,962 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 61 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 00:05:38,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 592 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 00:05:38,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-02-06 00:05:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 283. [2025-02-06 00:05:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 182 states have (on average 1.379120879120879) internal successors, (251), 182 states have internal predecessors, (251), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 00:05:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 443 transitions. [2025-02-06 00:05:38,998 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 443 transitions. Word has length 298 [2025-02-06 00:05:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:05:39,000 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 443 transitions. [2025-02-06 00:05:39,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (48), 1 states have call predecessors, (48), 1 states have return successors, (48), 1 states have call predecessors, (48), 1 states have call successors, (48) [2025-02-06 00:05:39,000 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 443 transitions. [2025-02-06 00:05:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2025-02-06 00:05:39,003 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:05:39,003 INFO L218 NwaCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 00:05:39,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 00:05:39,004 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:05:39,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:05:39,004 INFO L85 PathProgramCache]: Analyzing trace with hash -774909886, now seen corresponding path program 1 times [2025-02-06 00:05:39,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:05:39,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455690046] [2025-02-06 00:05:39,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:05:39,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:05:39,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 298 statements into 1 equivalence classes. [2025-02-06 00:05:39,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 298 of 298 statements. [2025-02-06 00:05:39,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:05:39,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat