./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-65.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 70d54a7730aec233a95490e3f0620c9d31c7d77ce29db2e5aff41d48560470e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:21:14,801 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:21:14,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:21:14,867 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:21:14,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:21:14,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:21:14,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:21:14,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:21:14,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:21:14,884 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:21:14,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:21:14,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:21:14,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:21:14,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:21:14,885 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:21:14,886 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:21:14,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:21:14,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:21:14,886 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:21:14,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:21:14,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:21:14,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:21:14,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:21:14,886 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:21:14,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:21:14,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:21:14,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:21:14,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:21:14,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:21:14,887 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:21:14,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:21:14,888 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70d54a7730aec233a95490e3f0620c9d31c7d77ce29db2e5aff41d48560470e5 [2025-03-08 11:21:15,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:21:15,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:21:15,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:21:15,153 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:21:15,154 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:21:15,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-65.i [2025-03-08 11:21:16,291 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef0d5f995/1917aec5533947189f76112374833f5f/FLAG5ddc9637a [2025-03-08 11:21:16,549 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:21:16,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-65.i [2025-03-08 11:21:16,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef0d5f995/1917aec5533947189f76112374833f5f/FLAG5ddc9637a [2025-03-08 11:21:16,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef0d5f995/1917aec5533947189f76112374833f5f [2025-03-08 11:21:16,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:21:16,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:21:16,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:21:16,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:21:16,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:21:16,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:21:16" (1/1) ... [2025-03-08 11:21:16,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7597c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:16, skipping insertion in model container [2025-03-08 11:21:16,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:21:16" (1/1) ... [2025-03-08 11:21:16,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:21:16,986 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-65.i[916,929] [2025-03-08 11:21:17,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:21:17,163 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:21:17,173 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-65.i[916,929] [2025-03-08 11:21:17,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:21:17,279 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:21:17,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17 WrapperNode [2025-03-08 11:21:17,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:21:17,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:21:17,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:21:17,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:21:17,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,367 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 869 [2025-03-08 11:21:17,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:21:17,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:21:17,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:21:17,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:21:17,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,420 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 11:21:17,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,450 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:21:17,475 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:21:17,476 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:21:17,476 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:21:17,478 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (1/1) ... [2025-03-08 11:21:17,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:21:17,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:21:17,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 11:21:17,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 11:21:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:21:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:21:17,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:21:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:21:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:21:17,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:21:17,649 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:21:17,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:21:18,417 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: havoc property_#t~bitwise77#1;havoc property_#t~short78#1;havoc property_#t~bitwise79#1;havoc property_#t~short80#1; [2025-03-08 11:21:18,621 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-08 11:21:18,621 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:21:18,653 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:21:18,653 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-08 11:21:18,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:21:18 BoogieIcfgContainer [2025-03-08 11:21:18,654 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:21:18,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:21:18,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:21:18,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:21:18,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:21:16" (1/3) ... [2025-03-08 11:21:18,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b37476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:21:18, skipping insertion in model container [2025-03-08 11:21:18,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:21:17" (2/3) ... [2025-03-08 11:21:18,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b37476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:21:18, skipping insertion in model container [2025-03-08 11:21:18,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:21:18" (3/3) ... [2025-03-08 11:21:18,661 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-65.i [2025-03-08 11:21:18,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:21:18,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-65.i that has 2 procedures, 346 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:21:18,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:21:18,735 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;@2aebb363, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:21:18,736 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:21:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 346 states, 240 states have (on average 1.5791666666666666) internal successors, (379), 241 states have internal predecessors, (379), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-08 11:21:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2025-03-08 11:21:18,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:18,770 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:18,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:18,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash 480212635, now seen corresponding path program 1 times [2025-03-08 11:21:18,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:18,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194885741] [2025-03-08 11:21:18,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:18,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:18,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-03-08 11:21:18,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-03-08 11:21:18,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:18,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:19,388 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2025-03-08 11:21:19,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:19,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194885741] [2025-03-08 11:21:19,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194885741] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:21:19,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434835142] [2025-03-08 11:21:19,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:19,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:21:19,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:21:19,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:21:19,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 11:21:19,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-03-08 11:21:19,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-03-08 11:21:19,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:19,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:19,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 1622 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:21:19,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:21:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2025-03-08 11:21:19,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:21:19,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434835142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:19,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:21:19,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:21:19,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927814869] [2025-03-08 11:21:19,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:19,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:21:19,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:19,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:21:19,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:21:19,884 INFO L87 Difference]: Start difference. First operand has 346 states, 240 states have (on average 1.5791666666666666) internal successors, (379), 241 states have internal predecessors, (379), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 2 states, 2 states have (on average 85.5) internal successors, (171), 2 states have internal predecessors, (171), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) [2025-03-08 11:21:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:19,956 INFO L93 Difference]: Finished difference Result 684 states and 1266 transitions. [2025-03-08 11:21:19,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:21:19,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 85.5) internal successors, (171), 2 states have internal predecessors, (171), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) Word has length 681 [2025-03-08 11:21:19,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:19,965 INFO L225 Difference]: With dead ends: 684 [2025-03-08 11:21:19,966 INFO L226 Difference]: Without dead ends: 341 [2025-03-08 11:21:19,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:21:19,974 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:19,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:21:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-08 11:21:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-08 11:21:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 236 states have (on average 1.5466101694915255) internal successors, (365), 236 states have internal predecessors, (365), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-03-08 11:21:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 571 transitions. [2025-03-08 11:21:20,058 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 571 transitions. Word has length 681 [2025-03-08 11:21:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:20,059 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 571 transitions. [2025-03-08 11:21:20,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 85.5) internal successors, (171), 2 states have internal predecessors, (171), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) [2025-03-08 11:21:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 571 transitions. [2025-03-08 11:21:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-03-08 11:21:20,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:20,073 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:20,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:21:20,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 11:21:20,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:20,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:20,277 INFO L85 PathProgramCache]: Analyzing trace with hash -432035987, now seen corresponding path program 1 times [2025-03-08 11:21:20,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:20,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008959194] [2025-03-08 11:21:20,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:20,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:20,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-03-08 11:21:20,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-03-08 11:21:20,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:20,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008959194] [2025-03-08 11:21:20,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008959194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:20,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:20,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:21:20,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067619452] [2025-03-08 11:21:20,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:20,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:21:20,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:20,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:21:20,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:20,977 INFO L87 Difference]: Start difference. First operand 341 states and 571 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:21,099 INFO L93 Difference]: Finished difference Result 880 states and 1483 transitions. [2025-03-08 11:21:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:21:21,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 682 [2025-03-08 11:21:21,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:21,108 INFO L225 Difference]: With dead ends: 880 [2025-03-08 11:21:21,108 INFO L226 Difference]: Without dead ends: 542 [2025-03-08 11:21:21,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:21,110 INFO L435 NwaCegarLoop]: 803 mSDtfsCounter, 324 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:21,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1333 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:21:21,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-08 11:21:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 539. [2025-03-08 11:21:21,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 409 states have (on average 1.5941320293398533) internal successors, (652), 410 states have internal predecessors, (652), 127 states have call successors, (127), 2 states have call predecessors, (127), 2 states have return successors, (127), 126 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-08 11:21:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 906 transitions. [2025-03-08 11:21:21,174 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 906 transitions. Word has length 682 [2025-03-08 11:21:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:21,175 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 906 transitions. [2025-03-08 11:21:21,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:21,176 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 906 transitions. [2025-03-08 11:21:21,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-08 11:21:21,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:21,186 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:21,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:21:21,186 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:21,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash -767420836, now seen corresponding path program 1 times [2025-03-08 11:21:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:21,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629687460] [2025-03-08 11:21:21,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:21,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:21,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-08 11:21:21,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-08 11:21:21,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:21,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:21,576 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:21,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:21,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629687460] [2025-03-08 11:21:21,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629687460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:21,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:21,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:21:21,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894151948] [2025-03-08 11:21:21,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:21,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:21:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:21,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:21:21,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:21,581 INFO L87 Difference]: Start difference. First operand 539 states and 906 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:21,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:21,686 INFO L93 Difference]: Finished difference Result 1470 states and 2481 transitions. [2025-03-08 11:21:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:21:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 683 [2025-03-08 11:21:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:21,697 INFO L225 Difference]: With dead ends: 1470 [2025-03-08 11:21:21,699 INFO L226 Difference]: Without dead ends: 934 [2025-03-08 11:21:21,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:21,703 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 327 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:21,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1145 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:21:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-03-08 11:21:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2025-03-08 11:21:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 754 states have (on average 1.6153846153846154) internal successors, (1218), 757 states have internal predecessors, (1218), 171 states have call successors, (171), 4 states have call predecessors, (171), 4 states have return successors, (171), 168 states have call predecessors, (171), 171 states have call successors, (171) [2025-03-08 11:21:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1560 transitions. [2025-03-08 11:21:21,759 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1560 transitions. Word has length 683 [2025-03-08 11:21:21,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:21,762 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1560 transitions. [2025-03-08 11:21:21,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:21,762 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1560 transitions. [2025-03-08 11:21:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-08 11:21:21,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:21,770 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:21,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 11:21:21,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:21,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -876823044, now seen corresponding path program 1 times [2025-03-08 11:21:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:21,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540213055] [2025-03-08 11:21:21,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:21,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-08 11:21:21,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-08 11:21:21,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:21,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:22,052 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:22,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:22,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540213055] [2025-03-08 11:21:22,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540213055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:22,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:22,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:21:22,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177549123] [2025-03-08 11:21:22,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:22,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:21:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:22,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:21:22,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:22,056 INFO L87 Difference]: Start difference. First operand 930 states and 1560 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:22,179 INFO L93 Difference]: Finished difference Result 2659 states and 4446 transitions. [2025-03-08 11:21:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:21:22,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 683 [2025-03-08 11:21:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:22,191 INFO L225 Difference]: With dead ends: 2659 [2025-03-08 11:21:22,191 INFO L226 Difference]: Without dead ends: 1732 [2025-03-08 11:21:22,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:22,195 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 545 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:22,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1167 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:21:22,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-03-08 11:21:22,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1730. [2025-03-08 11:21:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1379 states have (on average 1.5801305293691081) internal successors, (2179), 1385 states have internal predecessors, (2179), 342 states have call successors, (342), 8 states have call predecessors, (342), 8 states have return successors, (342), 336 states have call predecessors, (342), 342 states have call successors, (342) [2025-03-08 11:21:22,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2863 transitions. [2025-03-08 11:21:22,310 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2863 transitions. Word has length 683 [2025-03-08 11:21:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:22,311 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2863 transitions. [2025-03-08 11:21:22,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:22,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2863 transitions. [2025-03-08 11:21:22,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-08 11:21:22,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:22,318 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:22,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 11:21:22,319 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:22,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash 377980155, now seen corresponding path program 1 times [2025-03-08 11:21:22,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409784172] [2025-03-08 11:21:22,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:22,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-08 11:21:22,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-08 11:21:22,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:22,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:22,583 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:22,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:22,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409784172] [2025-03-08 11:21:22,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409784172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:22,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:22,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:21:22,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479717618] [2025-03-08 11:21:22,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:22,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:21:22,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:22,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:21:22,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:22,585 INFO L87 Difference]: Start difference. First operand 1730 states and 2863 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:22,718 INFO L93 Difference]: Finished difference Result 3538 states and 5848 transitions. [2025-03-08 11:21:22,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:21:22,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 683 [2025-03-08 11:21:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:22,729 INFO L225 Difference]: With dead ends: 3538 [2025-03-08 11:21:22,730 INFO L226 Difference]: Without dead ends: 1811 [2025-03-08 11:21:22,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:22,734 INFO L435 NwaCegarLoop]: 736 mSDtfsCounter, 303 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:22,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1269 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:21:22,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-03-08 11:21:22,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1481. [2025-03-08 11:21:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1218 states have (on average 1.6018062397372743) internal successors, (1951), 1220 states have internal predecessors, (1951), 254 states have call successors, (254), 8 states have call predecessors, (254), 8 states have return successors, (254), 252 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-08 11:21:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2459 transitions. [2025-03-08 11:21:22,806 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2459 transitions. Word has length 683 [2025-03-08 11:21:22,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:22,807 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 2459 transitions. [2025-03-08 11:21:22,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:22,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2459 transitions. [2025-03-08 11:21:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-08 11:21:22,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:22,813 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:22,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 11:21:22,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:22,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:22,814 INFO L85 PathProgramCache]: Analyzing trace with hash -117296519, now seen corresponding path program 1 times [2025-03-08 11:21:22,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:22,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857329791] [2025-03-08 11:21:22,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:22,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-08 11:21:22,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-08 11:21:22,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:22,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:23,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:23,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857329791] [2025-03-08 11:21:23,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857329791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:23,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:23,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:21:23,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746872471] [2025-03-08 11:21:23,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:23,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:21:23,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:23,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:21:23,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:23,084 INFO L87 Difference]: Start difference. First operand 1481 states and 2459 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:23,216 INFO L93 Difference]: Finished difference Result 4437 states and 7371 transitions. [2025-03-08 11:21:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:21:23,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 683 [2025-03-08 11:21:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:23,230 INFO L225 Difference]: With dead ends: 4437 [2025-03-08 11:21:23,230 INFO L226 Difference]: Without dead ends: 2959 [2025-03-08 11:21:23,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:23,235 INFO L435 NwaCegarLoop]: 1085 mSDtfsCounter, 554 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:23,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1623 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:21:23,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-03-08 11:21:23,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1549. [2025-03-08 11:21:23,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1286 states have (on average 1.5917573872472783) internal successors, (2047), 1288 states have internal predecessors, (2047), 254 states have call successors, (254), 8 states have call predecessors, (254), 8 states have return successors, (254), 252 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-08 11:21:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2555 transitions. [2025-03-08 11:21:23,336 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2555 transitions. Word has length 683 [2025-03-08 11:21:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:23,336 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 2555 transitions. [2025-03-08 11:21:23,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2555 transitions. [2025-03-08 11:21:23,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-08 11:21:23,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:23,342 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:23,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 11:21:23,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:23,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:23,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1659947585, now seen corresponding path program 1 times [2025-03-08 11:21:23,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:23,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880079482] [2025-03-08 11:21:23,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:23,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:23,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-08 11:21:23,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-08 11:21:23,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:23,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:23,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:23,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880079482] [2025-03-08 11:21:23,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880079482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:23,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:23,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:21:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162546393] [2025-03-08 11:21:23,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:23,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:21:23,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:23,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:21:23,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:23,608 INFO L87 Difference]: Start difference. First operand 1549 states and 2555 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:23,698 INFO L93 Difference]: Finished difference Result 3019 states and 4979 transitions. [2025-03-08 11:21:23,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:21:23,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 684 [2025-03-08 11:21:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:23,707 INFO L225 Difference]: With dead ends: 3019 [2025-03-08 11:21:23,707 INFO L226 Difference]: Without dead ends: 1473 [2025-03-08 11:21:23,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:23,712 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 0 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:23,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1086 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:21:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-03-08 11:21:23,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2025-03-08 11:21:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1210 states have (on average 1.5826446280991735) internal successors, (1915), 1212 states have internal predecessors, (1915), 254 states have call successors, (254), 8 states have call predecessors, (254), 8 states have return successors, (254), 252 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-08 11:21:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2423 transitions. [2025-03-08 11:21:23,799 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2423 transitions. Word has length 684 [2025-03-08 11:21:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:23,800 INFO L471 AbstractCegarLoop]: Abstraction has 1473 states and 2423 transitions. [2025-03-08 11:21:23,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2423 transitions. [2025-03-08 11:21:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-08 11:21:23,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:23,809 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:23,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 11:21:23,809 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:23,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash -2102168868, now seen corresponding path program 1 times [2025-03-08 11:21:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:23,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915316815] [2025-03-08 11:21:23,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:23,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:23,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-08 11:21:23,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-08 11:21:23,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:23,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:24,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915316815] [2025-03-08 11:21:24,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915316815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:24,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:24,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:21:24,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471781551] [2025-03-08 11:21:24,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:24,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:21:24,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:24,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:21:24,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:24,161 INFO L87 Difference]: Start difference. First operand 1473 states and 2423 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:24,244 INFO L93 Difference]: Finished difference Result 2943 states and 4843 transitions. [2025-03-08 11:21:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:21:24,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 685 [2025-03-08 11:21:24,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:24,254 INFO L225 Difference]: With dead ends: 2943 [2025-03-08 11:21:24,254 INFO L226 Difference]: Without dead ends: 1473 [2025-03-08 11:21:24,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:21:24,257 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 391 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:24,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 540 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:21:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-03-08 11:21:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2025-03-08 11:21:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1210 states have (on average 1.58099173553719) internal successors, (1913), 1212 states have internal predecessors, (1913), 254 states have call successors, (254), 8 states have call predecessors, (254), 8 states have return successors, (254), 252 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-08 11:21:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2421 transitions. [2025-03-08 11:21:24,316 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2421 transitions. Word has length 685 [2025-03-08 11:21:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:24,317 INFO L471 AbstractCegarLoop]: Abstraction has 1473 states and 2421 transitions. [2025-03-08 11:21:24,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:24,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2421 transitions. [2025-03-08 11:21:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-03-08 11:21:24,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:24,323 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:24,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 11:21:24,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:24,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash 693395084, now seen corresponding path program 1 times [2025-03-08 11:21:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66920948] [2025-03-08 11:21:24,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:24,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:24,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-08 11:21:24,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-08 11:21:24,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:24,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:25,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:25,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66920948] [2025-03-08 11:21:25,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66920948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:25,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:25,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:21:25,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465072405] [2025-03-08 11:21:25,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:25,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:21:25,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:25,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:21:25,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:21:25,332 INFO L87 Difference]: Start difference. First operand 1473 states and 2421 transitions. Second operand has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:26,195 INFO L93 Difference]: Finished difference Result 5407 states and 8959 transitions. [2025-03-08 11:21:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 11:21:26,196 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 687 [2025-03-08 11:21:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:26,213 INFO L225 Difference]: With dead ends: 5407 [2025-03-08 11:21:26,213 INFO L226 Difference]: Without dead ends: 3937 [2025-03-08 11:21:26,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:21:26,218 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 1087 mSDsluCounter, 2883 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:26,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 4439 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 11:21:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2025-03-08 11:21:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 1481. [2025-03-08 11:21:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1218 states have (on average 1.577175697865353) internal successors, (1921), 1220 states have internal predecessors, (1921), 254 states have call successors, (254), 8 states have call predecessors, (254), 8 states have return successors, (254), 252 states have call predecessors, (254), 254 states have call successors, (254) [2025-03-08 11:21:26,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2429 transitions. [2025-03-08 11:21:26,385 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2429 transitions. Word has length 687 [2025-03-08 11:21:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:26,386 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 2429 transitions. [2025-03-08 11:21:26,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.166666666666668) internal successors, (175), 6 states have internal predecessors, (175), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2429 transitions. [2025-03-08 11:21:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-08 11:21:26,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:26,391 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:26,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 11:21:26,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:26,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1361918572, now seen corresponding path program 1 times [2025-03-08 11:21:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:26,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352678520] [2025-03-08 11:21:26,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:26,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-08 11:21:26,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-08 11:21:26,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:26,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:28,354 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:28,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:28,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352678520] [2025-03-08 11:21:28,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352678520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:28,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:28,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 11:21:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100113449] [2025-03-08 11:21:28,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:28,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 11:21:28,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:28,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 11:21:28,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:21:28,356 INFO L87 Difference]: Start difference. First operand 1481 states and 2429 transitions. Second operand has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:35,342 INFO L93 Difference]: Finished difference Result 14647 states and 23862 transitions. [2025-03-08 11:21:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 11:21:35,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 688 [2025-03-08 11:21:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:35,399 INFO L225 Difference]: With dead ends: 14647 [2025-03-08 11:21:35,400 INFO L226 Difference]: Without dead ends: 13169 [2025-03-08 11:21:35,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2025-03-08 11:21:35,408 INFO L435 NwaCegarLoop]: 1068 mSDtfsCounter, 5832 mSDsluCounter, 3469 mSDsCounter, 0 mSdLazyCounter, 2960 mSolverCounterSat, 2363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5832 SdHoareTripleChecker+Valid, 4537 SdHoareTripleChecker+Invalid, 5323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2363 IncrementalHoareTripleChecker+Valid, 2960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:35,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5832 Valid, 4537 Invalid, 5323 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2363 Valid, 2960 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-08 11:21:35,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13169 states. [2025-03-08 11:21:36,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13169 to 5543. [2025-03-08 11:21:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5543 states, 4614 states have (on average 1.5801907238838317) internal successors, (7291), 4626 states have internal predecessors, (7291), 894 states have call successors, (894), 34 states have call predecessors, (894), 34 states have return successors, (894), 882 states have call predecessors, (894), 894 states have call successors, (894) [2025-03-08 11:21:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 9079 transitions. [2025-03-08 11:21:36,040 INFO L78 Accepts]: Start accepts. Automaton has 5543 states and 9079 transitions. Word has length 688 [2025-03-08 11:21:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:36,041 INFO L471 AbstractCegarLoop]: Abstraction has 5543 states and 9079 transitions. [2025-03-08 11:21:36,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 16.0) internal successors, (176), 11 states have internal predecessors, (176), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:36,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5543 states and 9079 transitions. [2025-03-08 11:21:36,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-08 11:21:36,057 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:36,057 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:36,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 11:21:36,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:36,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:36,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1978819829, now seen corresponding path program 1 times [2025-03-08 11:21:36,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:36,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631055820] [2025-03-08 11:21:36,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:36,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:36,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-08 11:21:36,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-08 11:21:36,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:36,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:36,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:36,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631055820] [2025-03-08 11:21:36,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631055820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:36,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:36,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:21:36,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631565182] [2025-03-08 11:21:36,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:36,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:21:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:36,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:21:36,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:21:36,986 INFO L87 Difference]: Start difference. First operand 5543 states and 9079 transitions. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:40,922 INFO L93 Difference]: Finished difference Result 31905 states and 50602 transitions. [2025-03-08 11:21:40,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 11:21:40,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 688 [2025-03-08 11:21:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:41,003 INFO L225 Difference]: With dead ends: 31905 [2025-03-08 11:21:41,003 INFO L226 Difference]: Without dead ends: 26365 [2025-03-08 11:21:41,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-08 11:21:41,024 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 2114 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 3384 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 763 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:41,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 3384 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [763 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 11:21:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26365 states. [2025-03-08 11:21:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26365 to 19265. [2025-03-08 11:21:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19265 states, 15956 states have (on average 1.5480696916520431) internal successors, (24701), 16028 states have internal predecessors, (24701), 3134 states have call successors, (3134), 174 states have call predecessors, (3134), 174 states have return successors, (3134), 3062 states have call predecessors, (3134), 3134 states have call successors, (3134) [2025-03-08 11:21:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19265 states to 19265 states and 30969 transitions. [2025-03-08 11:21:42,746 INFO L78 Accepts]: Start accepts. Automaton has 19265 states and 30969 transitions. Word has length 688 [2025-03-08 11:21:42,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:42,747 INFO L471 AbstractCegarLoop]: Abstraction has 19265 states and 30969 transitions. [2025-03-08 11:21:42,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:42,748 INFO L276 IsEmpty]: Start isEmpty. Operand 19265 states and 30969 transitions. [2025-03-08 11:21:42,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-08 11:21:42,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:42,773 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:42,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 11:21:42,773 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:42,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:42,774 INFO L85 PathProgramCache]: Analyzing trace with hash 278091178, now seen corresponding path program 1 times [2025-03-08 11:21:42,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:42,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426733051] [2025-03-08 11:21:42,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:42,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:42,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-08 11:21:43,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-08 11:21:43,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:43,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:44,188 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:44,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:44,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426733051] [2025-03-08 11:21:44,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426733051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:44,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:44,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:21:44,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407992709] [2025-03-08 11:21:44,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:44,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:21:44,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:44,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:21:44,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:21:44,191 INFO L87 Difference]: Start difference. First operand 19265 states and 30969 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 3 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 3 states have call predecessors, (103), 3 states have call successors, (103) [2025-03-08 11:21:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:46,964 INFO L93 Difference]: Finished difference Result 39156 states and 62424 transitions. [2025-03-08 11:21:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:21:46,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 3 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 3 states have call predecessors, (103), 3 states have call successors, (103) Word has length 688 [2025-03-08 11:21:46,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:47,030 INFO L225 Difference]: With dead ends: 39156 [2025-03-08 11:21:47,030 INFO L226 Difference]: Without dead ends: 19894 [2025-03-08 11:21:47,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 11:21:47,069 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 651 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:47,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 1472 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:21:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19894 states. [2025-03-08 11:21:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19894 to 19893. [2025-03-08 11:21:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19893 states, 16420 states have (on average 1.5279537149817295) internal successors, (25089), 16493 states have internal predecessors, (25089), 3146 states have call successors, (3146), 326 states have call predecessors, (3146), 326 states have return successors, (3146), 3073 states have call predecessors, (3146), 3146 states have call successors, (3146) [2025-03-08 11:21:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19893 states to 19893 states and 31381 transitions. [2025-03-08 11:21:49,109 INFO L78 Accepts]: Start accepts. Automaton has 19893 states and 31381 transitions. Word has length 688 [2025-03-08 11:21:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:49,110 INFO L471 AbstractCegarLoop]: Abstraction has 19893 states and 31381 transitions. [2025-03-08 11:21:49,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 3 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 3 states have call predecessors, (103), 3 states have call successors, (103) [2025-03-08 11:21:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 19893 states and 31381 transitions. [2025-03-08 11:21:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-08 11:21:49,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:49,137 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:49,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 11:21:49,137 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:49,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1529363285, now seen corresponding path program 1 times [2025-03-08 11:21:49,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:49,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075766210] [2025-03-08 11:21:49,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:49,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:49,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-08 11:21:49,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-08 11:21:49,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:49,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:50,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:50,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075766210] [2025-03-08 11:21:50,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075766210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:50,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:50,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 11:21:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138783880] [2025-03-08 11:21:50,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:50,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 11:21:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:50,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 11:21:50,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:21:50,040 INFO L87 Difference]: Start difference. First operand 19893 states and 31381 transitions. Second operand has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:54,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:21:54,298 INFO L93 Difference]: Finished difference Result 69571 states and 111468 transitions. [2025-03-08 11:21:54,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 11:21:54,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 688 [2025-03-08 11:21:54,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:21:54,470 INFO L225 Difference]: With dead ends: 69571 [2025-03-08 11:21:54,470 INFO L226 Difference]: Without dead ends: 49701 [2025-03-08 11:21:54,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-08 11:21:54,524 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 1079 mSDsluCounter, 4203 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 5759 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 11:21:54,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 5759 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 11:21:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49701 states. [2025-03-08 11:21:56,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49701 to 19764. [2025-03-08 11:21:56,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19764 states, 16279 states have (on average 1.527857976534185) internal successors, (24872), 16352 states have internal predecessors, (24872), 3156 states have call successors, (3156), 328 states have call predecessors, (3156), 328 states have return successors, (3156), 3083 states have call predecessors, (3156), 3156 states have call successors, (3156) [2025-03-08 11:21:56,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19764 states to 19764 states and 31184 transitions. [2025-03-08 11:21:56,992 INFO L78 Accepts]: Start accepts. Automaton has 19764 states and 31184 transitions. Word has length 688 [2025-03-08 11:21:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:21:56,993 INFO L471 AbstractCegarLoop]: Abstraction has 19764 states and 31184 transitions. [2025-03-08 11:21:56,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.142857142857142) internal successors, (176), 7 states have internal predecessors, (176), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:21:56,993 INFO L276 IsEmpty]: Start isEmpty. Operand 19764 states and 31184 transitions. [2025-03-08 11:21:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-08 11:21:57,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:21:57,013 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:21:57,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 11:21:57,014 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:21:57,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:21:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1000868439, now seen corresponding path program 1 times [2025-03-08 11:21:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:21:57,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591204274] [2025-03-08 11:21:57,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:21:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:21:57,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-08 11:21:57,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-08 11:21:57,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:21:57,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:21:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-03-08 11:21:57,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:21:57,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591204274] [2025-03-08 11:21:57,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591204274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:21:57,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:21:57,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 11:21:57,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942109560] [2025-03-08 11:21:57,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:21:57,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 11:21:57,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:21:57,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 11:21:57,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 11:21:57,799 INFO L87 Difference]: Start difference. First operand 19764 states and 31184 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:22:04,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:22:04,326 INFO L93 Difference]: Finished difference Result 79046 states and 124794 transitions. [2025-03-08 11:22:04,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 11:22:04,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 691 [2025-03-08 11:22:04,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:22:04,490 INFO L225 Difference]: With dead ends: 79046 [2025-03-08 11:22:04,491 INFO L226 Difference]: Without dead ends: 59328 [2025-03-08 11:22:04,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 11:22:04,533 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 888 mSDsluCounter, 2301 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 3271 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 11:22:04,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 3271 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 11:22:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59328 states. [2025-03-08 11:22:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59328 to 59324. [2025-03-08 11:22:10,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59324 states, 48919 states have (on average 1.526973159712995) internal successors, (74698), 49136 states have internal predecessors, (74698), 9424 states have call successors, (9424), 980 states have call predecessors, (9424), 980 states have return successors, (9424), 9207 states have call predecessors, (9424), 9424 states have call successors, (9424) [2025-03-08 11:22:10,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59324 states to 59324 states and 93546 transitions. [2025-03-08 11:22:11,003 INFO L78 Accepts]: Start accepts. Automaton has 59324 states and 93546 transitions. Word has length 691 [2025-03-08 11:22:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:22:11,004 INFO L471 AbstractCegarLoop]: Abstraction has 59324 states and 93546 transitions. [2025-03-08 11:22:11,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-03-08 11:22:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 59324 states and 93546 transitions. [2025-03-08 11:22:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-08 11:22:11,042 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:22:11,043 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:22:11,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 11:22:11,043 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:22:11,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:22:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1241408568, now seen corresponding path program 1 times [2025-03-08 11:22:11,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:22:11,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009025339] [2025-03-08 11:22:11,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:22:11,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:22:11,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-08 11:22:11,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-08 11:22:11,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:22:11,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat