./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 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_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-?-798a7b3-m [2025-03-03 20:09:57,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:09:58,047 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:09:58,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:09:58,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:09:58,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:09:58,078 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:09:58,078 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:09:58,079 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:09:58,079 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:09:58,080 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:09:58,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:09:58,080 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:09:58,080 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:09:58,080 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:09:58,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:09:58,081 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:09:58,081 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:09:58,082 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:09:58,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:09:58,082 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-03 20:09:58,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:09:58,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:09:58,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:09:58,323 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:09:58,323 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:09:58,323 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-03 20:09:59,468 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcddd96f0/9c65ef357aba4fdfb4be18a60dcd04e5/FLAG95d82fdba [2025-03-03 20:09:59,784 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:09:59,785 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-03 20:09:59,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcddd96f0/9c65ef357aba4fdfb4be18a60dcd04e5/FLAG95d82fdba [2025-03-03 20:10:00,044 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcddd96f0/9c65ef357aba4fdfb4be18a60dcd04e5 [2025-03-03 20:10:00,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:10:00,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:10:00,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:00,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:10:00,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:10:00,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5513b188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00, skipping insertion in model container [2025-03-03 20:10:00,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:10:00,185 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-03 20:10:00,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:00,320 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:10:00,329 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-03 20:10:00,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:00,436 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:10:00,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00 WrapperNode [2025-03-03 20:10:00,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:00,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:00,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:10:00,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:10:00,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,527 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 869 [2025-03-03 20:10:00,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:00,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:10:00,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:10:00,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:10:00,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,580 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-03 20:10:00,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,600 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,620 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:10:00,634 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:10:00,634 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:10:00,635 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:10:00,636 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (1/1) ... [2025-03-03 20:10:00,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:00,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:00,663 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-03 20:10:00,665 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-03 20:10:00,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:10:00,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:10:00,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:10:00,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:10:00,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:10:00,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:10:00,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:10:00,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:10:01,625 INFO L1325 $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-03 20:10:01,857 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2025-03-03 20:10:01,857 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:10:01,885 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:10:01,886 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:10:01,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:01 BoogieIcfgContainer [2025-03-03 20:10:01,886 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:10:01,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:10:01,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:10:01,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:10:01,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:10:00" (1/3) ... [2025-03-03 20:10:01,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b147352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:01, skipping insertion in model container [2025-03-03 20:10:01,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:00" (2/3) ... [2025-03-03 20:10:01,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b147352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:01, skipping insertion in model container [2025-03-03 20:10:01,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:01" (3/3) ... [2025-03-03 20:10:01,897 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-65.i [2025-03-03 20:10:01,908 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:10:01,911 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-03 20:10:01,962 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:10:01,974 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;@70d6e33b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:10:01,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:10:01,978 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-03 20:10:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 682 [2025-03-03 20:10:02,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:02,005 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-03 20:10:02,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:02,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:02,010 INFO L85 PathProgramCache]: Analyzing trace with hash 480212635, now seen corresponding path program 1 times [2025-03-03 20:10:02,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040259617] [2025-03-03 20:10:02,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:02,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-03-03 20:10:02,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-03-03 20:10:02,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:02,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:02,606 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-03 20:10:02,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:02,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040259617] [2025-03-03 20:10:02,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040259617] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:02,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253780754] [2025-03-03 20:10:02,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:02,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:02,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:02,611 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-03 20:10:02,612 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-03 20:10:02,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 681 statements into 1 equivalence classes. [2025-03-03 20:10:02,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 681 of 681 statements. [2025-03-03 20:10:02,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:02,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:03,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 1622 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:10:03,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:03,101 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-03 20:10:03,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:03,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253780754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:03,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:03,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:10:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066884203] [2025-03-03 20:10:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:03,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:10:03,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:03,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:10:03,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:03,129 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-03 20:10:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:03,194 INFO L93 Difference]: Finished difference Result 684 states and 1266 transitions. [2025-03-03 20:10:03,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:10:03,199 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-03 20:10:03,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:03,210 INFO L225 Difference]: With dead ends: 684 [2025-03-03 20:10:03,211 INFO L226 Difference]: Without dead ends: 341 [2025-03-03 20:10:03,218 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-03 20:10:03,220 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-03 20:10:03,220 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-03 20:10:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-03 20:10:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2025-03-03 20:10:03,290 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-03 20:10:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 571 transitions. [2025-03-03 20:10:03,299 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 571 transitions. Word has length 681 [2025-03-03 20:10:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:03,300 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 571 transitions. [2025-03-03 20:10:03,300 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-03 20:10:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 571 transitions. [2025-03-03 20:10:03,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-03-03 20:10:03,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:03,314 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-03 20:10:03,323 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-03 20:10:03,518 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-03 20:10:03,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:03,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash -432035987, now seen corresponding path program 1 times [2025-03-03 20:10:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:03,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510203490] [2025-03-03 20:10:03,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:03,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:03,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-03-03 20:10:03,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-03-03 20:10:03,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:03,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:04,294 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-03 20:10:04,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:04,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510203490] [2025-03-03 20:10:04,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510203490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:04,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:04,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:04,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247074226] [2025-03-03 20:10:04,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:04,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:04,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:04,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:04,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:04,300 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-03 20:10:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:04,444 INFO L93 Difference]: Finished difference Result 880 states and 1483 transitions. [2025-03-03 20:10:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:04,446 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-03 20:10:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:04,453 INFO L225 Difference]: With dead ends: 880 [2025-03-03 20:10:04,454 INFO L226 Difference]: Without dead ends: 542 [2025-03-03 20:10:04,455 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-03 20:10:04,455 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-03 20:10:04,455 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-03 20:10:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-03 20:10:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 539. [2025-03-03 20:10:04,513 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-03 20:10:04,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 906 transitions. [2025-03-03 20:10:04,521 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 906 transitions. Word has length 682 [2025-03-03 20:10:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:04,523 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 906 transitions. [2025-03-03 20:10:04,524 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-03 20:10:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 906 transitions. [2025-03-03 20:10:04,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:10:04,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:04,537 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-03 20:10:04,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:10:04,538 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:04,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash -767420836, now seen corresponding path program 1 times [2025-03-03 20:10:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638545510] [2025-03-03 20:10:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:04,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:04,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:10:04,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:10:04,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:04,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:04,933 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-03 20:10:04,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:04,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638545510] [2025-03-03 20:10:04,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638545510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:04,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:04,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:04,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908261869] [2025-03-03 20:10:04,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:04,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:04,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:04,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:04,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:04,936 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-03 20:10:05,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:05,049 INFO L93 Difference]: Finished difference Result 1470 states and 2481 transitions. [2025-03-03 20:10:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:05,051 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-03 20:10:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:05,058 INFO L225 Difference]: With dead ends: 1470 [2025-03-03 20:10:05,059 INFO L226 Difference]: Without dead ends: 934 [2025-03-03 20:10:05,060 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-03 20:10:05,061 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 327 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03 20:10:05,061 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-03 20:10:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2025-03-03 20:10:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 930. [2025-03-03 20:10:05,115 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-03 20:10:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1560 transitions. [2025-03-03 20:10:05,120 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1560 transitions. Word has length 683 [2025-03-03 20:10:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:05,121 INFO L471 AbstractCegarLoop]: Abstraction has 930 states and 1560 transitions. [2025-03-03 20:10:05,121 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-03 20:10:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1560 transitions. [2025-03-03 20:10:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:10:05,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:05,128 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-03 20:10:05,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:10:05,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:05,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash -876823044, now seen corresponding path program 1 times [2025-03-03 20:10:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513593415] [2025-03-03 20:10:05,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:05,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:10:05,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:10:05,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:05,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:05,516 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-03 20:10:05,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:05,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513593415] [2025-03-03 20:10:05,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513593415] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:05,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:05,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:05,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073405675] [2025-03-03 20:10:05,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:05,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:05,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:05,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:05,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:05,519 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-03 20:10:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:05,657 INFO L93 Difference]: Finished difference Result 2659 states and 4446 transitions. [2025-03-03 20:10:05,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:05,657 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-03 20:10:05,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:05,671 INFO L225 Difference]: With dead ends: 2659 [2025-03-03 20:10:05,671 INFO L226 Difference]: Without dead ends: 1732 [2025-03-03 20:10:05,674 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-03 20:10:05,677 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-03 20:10:05,678 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-03 20:10:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2025-03-03 20:10:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1730. [2025-03-03 20:10:05,826 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-03 20:10:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2863 transitions. [2025-03-03 20:10:05,838 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2863 transitions. Word has length 683 [2025-03-03 20:10:05,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:05,839 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2863 transitions. [2025-03-03 20:10:05,840 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-03 20:10:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2863 transitions. [2025-03-03 20:10:05,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:10:05,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:05,848 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-03 20:10:05,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:10:05,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:05,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash 377980155, now seen corresponding path program 1 times [2025-03-03 20:10:05,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:05,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952607253] [2025-03-03 20:10:05,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:05,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:05,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:10:05,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:10:05,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:05,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:06,218 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-03 20:10:06,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:06,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952607253] [2025-03-03 20:10:06,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952607253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:06,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:06,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:06,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116311402] [2025-03-03 20:10:06,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:06,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:06,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:06,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:06,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:06,222 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-03 20:10:06,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:06,344 INFO L93 Difference]: Finished difference Result 3538 states and 5848 transitions. [2025-03-03 20:10:06,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:06,345 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-03 20:10:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:06,359 INFO L225 Difference]: With dead ends: 3538 [2025-03-03 20:10:06,359 INFO L226 Difference]: Without dead ends: 1811 [2025-03-03 20:10:06,364 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-03 20:10:06,365 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-03 20:10:06,365 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-03 20:10:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2025-03-03 20:10:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1481. [2025-03-03 20:10:06,430 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-03 20:10:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2459 transitions. [2025-03-03 20:10:06,437 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2459 transitions. Word has length 683 [2025-03-03 20:10:06,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:06,438 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 2459 transitions. [2025-03-03 20:10:06,439 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-03 20:10:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2459 transitions. [2025-03-03 20:10:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:10:06,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:06,444 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-03 20:10:06,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:10:06,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:06,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:06,445 INFO L85 PathProgramCache]: Analyzing trace with hash -117296519, now seen corresponding path program 1 times [2025-03-03 20:10:06,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:06,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548767913] [2025-03-03 20:10:06,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:06,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:10:06,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:10:06,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:06,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:06,705 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-03 20:10:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:06,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548767913] [2025-03-03 20:10:06,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548767913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:06,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528837767] [2025-03-03 20:10:06,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:06,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:06,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:06,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:06,708 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-03 20:10:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:06,852 INFO L93 Difference]: Finished difference Result 4437 states and 7371 transitions. [2025-03-03 20:10:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:06,853 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-03 20:10:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:06,867 INFO L225 Difference]: With dead ends: 4437 [2025-03-03 20:10:06,867 INFO L226 Difference]: Without dead ends: 2959 [2025-03-03 20:10:06,871 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-03 20:10:06,872 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-03 20:10:06,872 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-03 20:10:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2025-03-03 20:10:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 1549. [2025-03-03 20:10:06,978 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-03 20:10:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2555 transitions. [2025-03-03 20:10:06,987 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2555 transitions. Word has length 683 [2025-03-03 20:10:06,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:06,989 INFO L471 AbstractCegarLoop]: Abstraction has 1549 states and 2555 transitions. [2025-03-03 20:10:06,989 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-03 20:10:06,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2555 transitions. [2025-03-03 20:10:06,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-03 20:10:06,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:06,994 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-03 20:10:06,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:10:06,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:06,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:06,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1659947585, now seen corresponding path program 1 times [2025-03-03 20:10:06,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:06,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052168098] [2025-03-03 20:10:06,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:06,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:07,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-03 20:10:07,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-03 20:10:07,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:07,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:07,274 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-03 20:10:07,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:07,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052168098] [2025-03-03 20:10:07,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052168098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:07,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:07,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:07,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361885143] [2025-03-03 20:10:07,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:07,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:07,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:07,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:07,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:07,277 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-03 20:10:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:07,349 INFO L93 Difference]: Finished difference Result 3019 states and 4979 transitions. [2025-03-03 20:10:07,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:07,350 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-03 20:10:07,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:07,357 INFO L225 Difference]: With dead ends: 3019 [2025-03-03 20:10:07,357 INFO L226 Difference]: Without dead ends: 1473 [2025-03-03 20:10:07,360 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-03 20:10:07,360 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-03 20:10:07,361 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-03 20:10:07,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-03-03 20:10:07,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2025-03-03 20:10:07,418 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-03 20:10:07,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2423 transitions. [2025-03-03 20:10:07,441 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2423 transitions. Word has length 684 [2025-03-03 20:10:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:07,442 INFO L471 AbstractCegarLoop]: Abstraction has 1473 states and 2423 transitions. [2025-03-03 20:10:07,442 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-03 20:10:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2423 transitions. [2025-03-03 20:10:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-03-03 20:10:07,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:07,447 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-03 20:10:07,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:10:07,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:07,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash -2102168868, now seen corresponding path program 1 times [2025-03-03 20:10:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:07,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993258126] [2025-03-03 20:10:07,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:07,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-03-03 20:10:07,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-03-03 20:10:07,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:07,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:07,813 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-03 20:10:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993258126] [2025-03-03 20:10:07,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993258126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:07,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:07,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:07,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996326646] [2025-03-03 20:10:07,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:07,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:07,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:07,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:07,815 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-03 20:10:07,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:07,884 INFO L93 Difference]: Finished difference Result 2943 states and 4843 transitions. [2025-03-03 20:10:07,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:07,885 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-03 20:10:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:07,892 INFO L225 Difference]: With dead ends: 2943 [2025-03-03 20:10:07,892 INFO L226 Difference]: Without dead ends: 1473 [2025-03-03 20:10:07,895 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-03 20:10:07,895 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-03 20:10:07,896 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-03 20:10:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-03-03 20:10:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2025-03-03 20:10:07,954 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-03 20:10:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2421 transitions. [2025-03-03 20:10:07,960 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 2421 transitions. Word has length 685 [2025-03-03 20:10:07,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:07,961 INFO L471 AbstractCegarLoop]: Abstraction has 1473 states and 2421 transitions. [2025-03-03 20:10:07,961 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-03 20:10:07,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 2421 transitions. [2025-03-03 20:10:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2025-03-03 20:10:07,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:07,966 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-03 20:10:07,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:10:07,966 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:07,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:07,967 INFO L85 PathProgramCache]: Analyzing trace with hash 693395084, now seen corresponding path program 1 times [2025-03-03 20:10:07,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:07,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634393591] [2025-03-03 20:10:07,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:07,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:07,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 687 statements into 1 equivalence classes. [2025-03-03 20:10:08,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 687 of 687 statements. [2025-03-03 20:10:08,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:08,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:09,045 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-03 20:10:09,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:09,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634393591] [2025-03-03 20:10:09,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634393591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:09,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:09,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:10:09,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107605404] [2025-03-03 20:10:09,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:09,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:10:09,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:09,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:10:09,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:10:09,048 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-03 20:10:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:09,951 INFO L93 Difference]: Finished difference Result 5407 states and 8959 transitions. [2025-03-03 20:10:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:10:09,952 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-03 20:10:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:09,972 INFO L225 Difference]: With dead ends: 5407 [2025-03-03 20:10:09,972 INFO L226 Difference]: Without dead ends: 3937 [2025-03-03 20:10:09,976 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-03 20:10:09,977 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-03 20:10:09,977 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-03 20:10:09,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2025-03-03 20:10:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 1481. [2025-03-03 20:10:10,174 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-03 20:10:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2429 transitions. [2025-03-03 20:10:10,181 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2429 transitions. Word has length 687 [2025-03-03 20:10:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:10,182 INFO L471 AbstractCegarLoop]: Abstraction has 1481 states and 2429 transitions. [2025-03-03 20:10:10,183 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-03 20:10:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2429 transitions. [2025-03-03 20:10:10,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 20:10:10,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:10,189 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-03 20:10:10,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:10:10,189 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:10,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1361918572, now seen corresponding path program 1 times [2025-03-03 20:10:10,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:10,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977100842] [2025-03-03 20:10:10,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:10,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:10,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 20:10:10,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 20:10:10,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:10,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:12,335 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-03 20:10:12,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:12,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977100842] [2025-03-03 20:10:12,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977100842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:12,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:12,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 20:10:12,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608988241] [2025-03-03 20:10:12,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:12,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:10:12,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:12,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:10:12,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:10:12,337 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-03 20:10:19,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:19,202 INFO L93 Difference]: Finished difference Result 14647 states and 23862 transitions. [2025-03-03 20:10:19,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 20:10:19,203 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-03 20:10:19,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:19,256 INFO L225 Difference]: With dead ends: 14647 [2025-03-03 20:10:19,256 INFO L226 Difference]: Without dead ends: 13169 [2025-03-03 20:10:19,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2025-03-03 20:10:19,265 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.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:19,266 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.0s Time] [2025-03-03 20:10:19,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13169 states. [2025-03-03 20:10:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13169 to 5543. [2025-03-03 20:10:19,837 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-03 20:10:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 9079 transitions. [2025-03-03 20:10:19,855 INFO L78 Accepts]: Start accepts. Automaton has 5543 states and 9079 transitions. Word has length 688 [2025-03-03 20:10:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:19,856 INFO L471 AbstractCegarLoop]: Abstraction has 5543 states and 9079 transitions. [2025-03-03 20:10:19,857 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-03 20:10:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 5543 states and 9079 transitions. [2025-03-03 20:10:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 20:10:19,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:19,865 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-03 20:10:19,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:10:19,865 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:19,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1978819829, now seen corresponding path program 1 times [2025-03-03 20:10:19,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:19,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544627784] [2025-03-03 20:10:19,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:19,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:19,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 20:10:19,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 20:10:19,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:19,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:20,831 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-03 20:10:20,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:20,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544627784] [2025-03-03 20:10:20,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544627784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:20,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:20,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:10:20,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115005295] [2025-03-03 20:10:20,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:20,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:10:20,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:20,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:10:20,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:10:20,835 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-03 20:10:24,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:24,696 INFO L93 Difference]: Finished difference Result 31905 states and 50602 transitions. [2025-03-03 20:10:24,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 20:10:24,697 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-03 20:10:24,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:24,782 INFO L225 Difference]: With dead ends: 31905 [2025-03-03 20:10:24,782 INFO L226 Difference]: Without dead ends: 26365 [2025-03-03 20:10:24,800 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-03 20:10:24,800 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 2114 mSDsluCounter, 2647 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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-03 20:10:24,801 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-03 20:10:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26365 states. [2025-03-03 20:10:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26365 to 19265. [2025-03-03 20:10:26,704 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-03 20:10:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19265 states to 19265 states and 30969 transitions. [2025-03-03 20:10:26,760 INFO L78 Accepts]: Start accepts. Automaton has 19265 states and 30969 transitions. Word has length 688 [2025-03-03 20:10:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 19265 states and 30969 transitions. [2025-03-03 20:10:26,762 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-03 20:10:26,762 INFO L276 IsEmpty]: Start isEmpty. Operand 19265 states and 30969 transitions. [2025-03-03 20:10:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 20:10:26,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:26,788 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-03 20:10:26,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:10:26,789 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:26,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash 278091178, now seen corresponding path program 1 times [2025-03-03 20:10:26,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:26,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433258561] [2025-03-03 20:10:26,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:26,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:26,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 20:10:26,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 20:10:26,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:26,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:28,088 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-03 20:10:28,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:28,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433258561] [2025-03-03 20:10:28,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433258561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:28,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:28,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:10:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765158841] [2025-03-03 20:10:28,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:28,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:10:28,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:28,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:10:28,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:28,092 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-03 20:10:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:30,847 INFO L93 Difference]: Finished difference Result 39156 states and 62424 transitions. [2025-03-03 20:10:30,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:10:30,847 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-03 20:10:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:30,910 INFO L225 Difference]: With dead ends: 39156 [2025-03-03 20:10:30,910 INFO L226 Difference]: Without dead ends: 19894 [2025-03-03 20:10:30,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:10:30,943 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-03 20:10:30,944 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-03 20:10:30,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19894 states. [2025-03-03 20:10:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19894 to 19893. [2025-03-03 20:10:32,839 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-03 20:10:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19893 states to 19893 states and 31381 transitions. [2025-03-03 20:10:32,958 INFO L78 Accepts]: Start accepts. Automaton has 19893 states and 31381 transitions. Word has length 688 [2025-03-03 20:10:32,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:32,959 INFO L471 AbstractCegarLoop]: Abstraction has 19893 states and 31381 transitions. [2025-03-03 20:10:32,959 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-03 20:10:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 19893 states and 31381 transitions. [2025-03-03 20:10:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 689 [2025-03-03 20:10:33,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:33,012 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-03 20:10:33,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:10:33,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:33,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:33,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1529363285, now seen corresponding path program 1 times [2025-03-03 20:10:33,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652820211] [2025-03-03 20:10:33,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:33,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 688 statements into 1 equivalence classes. [2025-03-03 20:10:33,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 688 of 688 statements. [2025-03-03 20:10:33,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:33,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:35,130 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-03 20:10:35,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:35,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652820211] [2025-03-03 20:10:35,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652820211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:35,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:35,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:10:35,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508615068] [2025-03-03 20:10:35,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:35,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:10:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:35,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:10:35,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:35,139 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-03 20:10:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:40,305 INFO L93 Difference]: Finished difference Result 69571 states and 111468 transitions. [2025-03-03 20:10:40,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:10:40,306 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-03 20:10:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:40,463 INFO L225 Difference]: With dead ends: 69571 [2025-03-03 20:10:40,463 INFO L226 Difference]: Without dead ends: 49701 [2025-03-03 20:10:40,514 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-03 20:10:40,515 INFO L435 NwaCegarLoop]: 1556 mSDtfsCounter, 1079 mSDsluCounter, 4203 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:40,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 5759 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 20:10:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49701 states. [2025-03-03 20:10:43,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49701 to 19764. [2025-03-03 20:10:43,117 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-03 20:10:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19764 states to 19764 states and 31184 transitions. [2025-03-03 20:10:43,196 INFO L78 Accepts]: Start accepts. Automaton has 19764 states and 31184 transitions. Word has length 688 [2025-03-03 20:10:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:43,200 INFO L471 AbstractCegarLoop]: Abstraction has 19764 states and 31184 transitions. [2025-03-03 20:10:43,200 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-03 20:10:43,200 INFO L276 IsEmpty]: Start isEmpty. Operand 19764 states and 31184 transitions. [2025-03-03 20:10:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-03 20:10:43,231 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:43,231 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-03 20:10:43,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:10:43,232 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:43,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1000868439, now seen corresponding path program 1 times [2025-03-03 20:10:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:43,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336580519] [2025-03-03 20:10:43,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:43,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-03 20:10:43,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-03 20:10:43,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:43,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:44,115 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-03 20:10:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:44,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336580519] [2025-03-03 20:10:44,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336580519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:44,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:44,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:10:44,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061520403] [2025-03-03 20:10:44,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:44,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:10:44,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:44,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:10:44,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:10:44,121 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-03 20:10:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:51,102 INFO L93 Difference]: Finished difference Result 79046 states and 124794 transitions. [2025-03-03 20:10:51,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:10:51,102 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-03 20:10:51,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:51,284 INFO L225 Difference]: With dead ends: 79046 [2025-03-03 20:10:51,284 INFO L226 Difference]: Without dead ends: 59328 [2025-03-03 20:10:51,325 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-03 20:10:51,326 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-03 20:10:51,326 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-03 20:10:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59328 states. [2025-03-03 20:10:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59328 to 59324. [2025-03-03 20:10:56,957 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-03 20:10:57,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59324 states to 59324 states and 93546 transitions. [2025-03-03 20:10:57,140 INFO L78 Accepts]: Start accepts. Automaton has 59324 states and 93546 transitions. Word has length 691 [2025-03-03 20:10:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:57,141 INFO L471 AbstractCegarLoop]: Abstraction has 59324 states and 93546 transitions. [2025-03-03 20:10:57,141 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-03 20:10:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 59324 states and 93546 transitions. [2025-03-03 20:10:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 692 [2025-03-03 20:10:57,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:57,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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:57,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 20:10:57,186 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:57,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:57,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1241408568, now seen corresponding path program 1 times [2025-03-03 20:10:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:57,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279546961] [2025-03-03 20:10:57,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:57,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:57,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 691 statements into 1 equivalence classes. [2025-03-03 20:10:57,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 691 of 691 statements. [2025-03-03 20:10:57,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat