./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-91.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_operatoramount_amount250_file-91.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 98e66c61c01623c41b31710156dd9accf1ba643ca7c07eb5ec3e619f761304a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:16:46,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:16:47,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:16:47,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:16:47,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:16:47,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:16:47,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:16:47,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:16:47,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:16:47,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:16:47,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:16:47,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:16:47,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:16:47,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:16:47,036 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:16:47,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:16:47,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:16:47,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:16:47,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:16:47,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:16:47,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:16:47,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:16:47,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:16:47,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:16:47,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:16:47,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:16:47,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:16:47,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:16:47,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:16:47,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:16:47,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:16:47,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:16:47,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:16:47,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:16:47,038 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 -> 98e66c61c01623c41b31710156dd9accf1ba643ca7c07eb5ec3e619f761304a5 [2025-03-04 00:16:47,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:16:47,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:16:47,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:16:47,245 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:16:47,245 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:16:47,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-91.i [2025-03-04 00:16:48,317 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394940b91/ef0873528a964f82a90bcd15b5117fc1/FLAG71d1205e0 [2025-03-04 00:16:48,577 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:16:48,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-91.i [2025-03-04 00:16:48,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394940b91/ef0873528a964f82a90bcd15b5117fc1/FLAG71d1205e0 [2025-03-04 00:16:48,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/394940b91/ef0873528a964f82a90bcd15b5117fc1 [2025-03-04 00:16:48,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:16:48,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:16:48,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:16:48,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:16:48,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:16:48,601 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:48,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd20196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48, skipping insertion in model container [2025-03-04 00:16:48,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:48,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:16:48,731 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_operatoramount_amount250_file-91.i[916,929] [2025-03-04 00:16:48,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:16:48,865 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:16:48,872 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_operatoramount_amount250_file-91.i[916,929] [2025-03-04 00:16:48,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:16:48,934 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:16:48,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48 WrapperNode [2025-03-04 00:16:48,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:16:48,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:16:48,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:16:48,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:16:48,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:48,951 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,005 INFO L138 Inliner]: procedures = 26, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 512 [2025-03-04 00:16:49,006 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:16:49,006 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:16:49,006 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:16:49,006 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:16:49,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,053 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-04 00:16:49,053 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,077 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:16:49,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:16:49,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:16:49,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:16:49,109 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (1/1) ... [2025-03-04 00:16:49,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:16:49,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:49,132 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-04 00:16:49,137 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-04 00:16:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:16:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:16:49,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:16:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:16:49,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:16:49,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:16:49,234 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:16:49,236 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:16:49,873 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L372: havoc property_#t~bitwise44#1;havoc property_#t~bitwise45#1;havoc property_#t~short46#1;havoc property_#t~bitwise47#1;havoc property_#t~short48#1;havoc property_#t~bitwise49#1;havoc property_#t~bitwise50#1;havoc property_#t~short51#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short54#1; [2025-03-04 00:16:49,935 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2025-03-04 00:16:49,935 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:16:49,960 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:16:49,962 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:16:49,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:16:49 BoogieIcfgContainer [2025-03-04 00:16:49,962 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:16:49,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:16:49,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:16:49,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:16:49,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:16:48" (1/3) ... [2025-03-04 00:16:49,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2340d08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:16:49, skipping insertion in model container [2025-03-04 00:16:49,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:16:48" (2/3) ... [2025-03-04 00:16:49,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2340d08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:16:49, skipping insertion in model container [2025-03-04 00:16:49,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:16:49" (3/3) ... [2025-03-04 00:16:49,969 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-91.i [2025-03-04 00:16:49,978 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:16:49,979 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-91.i that has 2 procedures, 211 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:16:50,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:16:50,048 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;@21fdb2b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:16:50,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:16:50,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 211 states, 151 states have (on average 1.490066225165563) internal successors, (225), 152 states have internal predecessors, (225), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 00:16:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-04 00:16:50,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:50,065 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:16:50,065 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:50,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:50,069 INFO L85 PathProgramCache]: Analyzing trace with hash -395481878, now seen corresponding path program 1 times [2025-03-04 00:16:50,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:50,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162899789] [2025-03-04 00:16:50,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:50,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:16:50,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:16:50,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:50,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-03-04 00:16:50,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:50,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162899789] [2025-03-04 00:16:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162899789] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:16:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43095348] [2025-03-04 00:16:50,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:50,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:16:50,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:16:50,482 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-04 00:16:50,483 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-04 00:16:50,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:16:50,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:16:50,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:50,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:50,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:16:50,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:16:50,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 6272 trivial. 0 not checked. [2025-03-04 00:16:50,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:16:50,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43095348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:50,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:16:50,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:16:50,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421637616] [2025-03-04 00:16:50,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:50,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:16:50,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:50,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:16:50,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:16:50,791 INFO L87 Difference]: Start difference. First operand has 211 states, 151 states have (on average 1.490066225165563) internal successors, (225), 152 states have internal predecessors, (225), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-04 00:16:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:50,842 INFO L93 Difference]: Finished difference Result 415 states and 728 transitions. [2025-03-04 00:16:50,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:16:50,843 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) Word has length 375 [2025-03-04 00:16:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:50,852 INFO L225 Difference]: With dead ends: 415 [2025-03-04 00:16:50,852 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 00:16:50,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 376 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-04 00:16:50,860 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:50,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:16:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 00:16:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2025-03-04 00:16:50,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 148 states have (on average 1.4662162162162162) internal successors, (217), 148 states have internal predecessors, (217), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 00:16:50,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 331 transitions. [2025-03-04 00:16:50,916 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 331 transitions. Word has length 375 [2025-03-04 00:16:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:50,918 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 331 transitions. [2025-03-04 00:16:50,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (57), 2 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-04 00:16:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 331 transitions. [2025-03-04 00:16:50,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-04 00:16:50,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:50,927 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:16:50,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:16:51,127 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-04 00:16:51,128 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:51,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1328767253, now seen corresponding path program 1 times [2025-03-04 00:16:51,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:51,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188702345] [2025-03-04 00:16:51,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:51,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:16:51,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:16:51,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:51,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-04 00:16:51,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:51,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188702345] [2025-03-04 00:16:51,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188702345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:51,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:51,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:16:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67778796] [2025-03-04 00:16:51,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:51,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:16:51,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:51,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:16:51,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:16:51,417 INFO L87 Difference]: Start difference. First operand 207 states and 331 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-04 00:16:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:51,584 INFO L93 Difference]: Finished difference Result 606 states and 969 transitions. [2025-03-04 00:16:51,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:16:51,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 375 [2025-03-04 00:16:51,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:51,590 INFO L225 Difference]: With dead ends: 606 [2025-03-04 00:16:51,590 INFO L226 Difference]: Without dead ends: 402 [2025-03-04 00:16:51,591 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-04 00:16:51,592 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 300 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:51,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 760 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:16:51,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-03-04 00:16:51,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 264. [2025-03-04 00:16:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 205 states have (on average 1.4780487804878049) internal successors, (303), 205 states have internal predecessors, (303), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 00:16:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 417 transitions. [2025-03-04 00:16:51,629 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 417 transitions. Word has length 375 [2025-03-04 00:16:51,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:51,630 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 417 transitions. [2025-03-04 00:16:51,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-04 00:16:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 417 transitions. [2025-03-04 00:16:51,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-03-04 00:16:51,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:51,634 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:16:51,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:16:51,634 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:51,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:51,635 INFO L85 PathProgramCache]: Analyzing trace with hash -978886380, now seen corresponding path program 1 times [2025-03-04 00:16:51,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:51,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159808620] [2025-03-04 00:16:51,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:51,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:51,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-03-04 00:16:51,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-03-04 00:16:51,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:51,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:51,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-04 00:16:51,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:51,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159808620] [2025-03-04 00:16:51,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159808620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:51,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:51,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:16:51,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871262239] [2025-03-04 00:16:51,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:51,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:16:51,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:51,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:16:51,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:16:51,944 INFO L87 Difference]: Start difference. First operand 264 states and 417 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-04 00:16:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:52,028 INFO L93 Difference]: Finished difference Result 465 states and 739 transitions. [2025-03-04 00:16:52,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:16:52,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 375 [2025-03-04 00:16:52,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:52,033 INFO L225 Difference]: With dead ends: 465 [2025-03-04 00:16:52,033 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 00:16:52,034 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-04 00:16:52,035 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 296 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:52,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 280 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:16:52,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 00:16:52,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-04 00:16:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 145 states have (on average 1.3655172413793104) internal successors, (198), 145 states have internal predecessors, (198), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-04 00:16:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 312 transitions. [2025-03-04 00:16:52,056 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 312 transitions. Word has length 375 [2025-03-04 00:16:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:52,057 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 312 transitions. [2025-03-04 00:16:52,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2025-03-04 00:16:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 312 transitions. [2025-03-04 00:16:52,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2025-03-04 00:16:52,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:52,061 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:16:52,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:16:52,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:52,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash 243676973, now seen corresponding path program 1 times [2025-03-04 00:16:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858633126] [2025-03-04 00:16:52,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:52,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:52,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes. [2025-03-04 00:16:52,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements. [2025-03-04 00:16:52,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:52,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:16:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2025-03-04 00:16:52,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:16:52,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858633126] [2025-03-04 00:16:52,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858633126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:16:52,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:16:52,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:16:52,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879035555] [2025-03-04 00:16:52,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:16:52,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:16:52,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:16:52,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:16:52,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:16:52,675 INFO L87 Difference]: Start difference. First operand 204 states and 312 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-04 00:16:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:16:52,929 INFO L93 Difference]: Finished difference Result 606 states and 930 transitions. [2025-03-04 00:16:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:16:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 376 [2025-03-04 00:16:52,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:16:52,933 INFO L225 Difference]: With dead ends: 606 [2025-03-04 00:16:52,933 INFO L226 Difference]: Without dead ends: 405 [2025-03-04 00:16:52,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:16:52,936 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 228 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:16:52,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 930 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:16:52,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-04 00:16:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2025-03-04 00:16:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 285 states have (on average 1.3614035087719298) internal successors, (388), 285 states have internal predecessors, (388), 114 states have call successors, (114), 2 states have call predecessors, (114), 2 states have return successors, (114), 114 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-04 00:16:52,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 616 transitions. [2025-03-04 00:16:52,997 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 616 transitions. Word has length 376 [2025-03-04 00:16:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:16:52,999 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 616 transitions. [2025-03-04 00:16:52,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2025-03-04 00:16:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 616 transitions. [2025-03-04 00:16:53,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-04 00:16:53,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:16:53,002 INFO L218 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:16:53,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:16:53,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:16:53,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:16:53,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1956928159, now seen corresponding path program 1 times [2025-03-04 00:16:53,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:16:53,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730344389] [2025-03-04 00:16:53,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:16:53,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:16:53,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-04 00:16:53,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-04 00:16:53,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:16:53,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat