./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-35.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 299d219523e0e8430505eb8799431fd2cb8b55f1a08a4fbf5c709cb9d599e48c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:39:46,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:39:46,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:39:46,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:39:46,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:39:46,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:39:46,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:39:46,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:39:46,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:39:46,328 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:39:46,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:39:46,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:39:46,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:39:46,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:39:46,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:39:46,330 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:39:46,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:39:46,330 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:39:46,330 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:39:46,330 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:39:46,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:39:46,330 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:39:46,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:39:46,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:39:46,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:39:46,330 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:39:46,331 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:39:46,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:39:46,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:39:46,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:39:46,331 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:39:46,331 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:39:46,331 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:39:46,331 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:39:46,331 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 299d219523e0e8430505eb8799431fd2cb8b55f1a08a4fbf5c709cb9d599e48c [2025-02-06 02:39:46,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:39:46,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:39:46,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:39:46,569 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:39:46,569 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:39:46,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-35.i [2025-02-06 02:39:47,759 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d2f0d044/317720c275424b018615f6c9adf98ca1/FLAGaa5c9885f [2025-02-06 02:39:48,128 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:39:48,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-35.i [2025-02-06 02:39:48,143 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d2f0d044/317720c275424b018615f6c9adf98ca1/FLAGaa5c9885f [2025-02-06 02:39:48,344 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5d2f0d044/317720c275424b018615f6c9adf98ca1 [2025-02-06 02:39:48,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:39:48,347 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:39:48,348 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:39:48,348 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:39:48,351 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:39:48,352 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:48,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa6c45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48, skipping insertion in model container [2025-02-06 02:39:48,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:48,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:39:48,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-35.i[916,929] [2025-02-06 02:39:48,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:39:48,715 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:39:48,725 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-35.i[916,929] [2025-02-06 02:39:48,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:39:48,828 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:39:48,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48 WrapperNode [2025-02-06 02:39:48,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:39:48,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:39:48,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:39:48,831 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:39:48,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:48,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:48,940 INFO L138 Inliner]: procedures = 26, calls = 92, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 782 [2025-02-06 02:39:48,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:39:48,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:39:48,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:39:48,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:39:48,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:48,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:48,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:49,028 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:39:49,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:49,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:49,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:49,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:49,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:49,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:49,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:39:49,087 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:39:49,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:39:49,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:39:49,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (1/1) ... [2025-02-06 02:39:49,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:39:49,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:49,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:39:49,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:39:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:39:49,144 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:39:49,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:39:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:39:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:39:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:39:49,265 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:39:49,266 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:39:50,127 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: havoc property_#t~bitwise57#1;havoc property_#t~short58#1;havoc property_#t~bitwise59#1;havoc property_#t~short60#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short63#1;havoc property_#t~ite65#1;havoc property_#t~bitwise64#1;havoc property_#t~short66#1;havoc property_#t~ite69#1;havoc property_#t~ite68#1;havoc property_#t~bitwise67#1;havoc property_#t~short70#1; [2025-02-06 02:39:50,287 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-02-06 02:39:50,287 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:39:50,312 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:39:50,319 INFO L337 CfgBuilder]: Removed 2 assume(true) statements. [2025-02-06 02:39:50,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:39:50 BoogieIcfgContainer [2025-02-06 02:39:50,319 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:39:50,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:39:50,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:39:50,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:39:50,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:39:48" (1/3) ... [2025-02-06 02:39:50,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b71d79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:39:50, skipping insertion in model container [2025-02-06 02:39:50,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:48" (2/3) ... [2025-02-06 02:39:50,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b71d79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:39:50, skipping insertion in model container [2025-02-06 02:39:50,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:39:50" (3/3) ... [2025-02-06 02:39:50,330 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-35.i [2025-02-06 02:39:50,340 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:39:50,343 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-35.i that has 2 procedures, 299 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:39:50,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:39:50,392 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;@533c9fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:39:50,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:39:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 217 states have (on average 1.5207373271889402) internal successors, (330), 218 states have internal predecessors, (330), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 02:39:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-02-06 02:39:50,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:50,417 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:50,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:50,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:50,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1563173850, now seen corresponding path program 1 times [2025-02-06 02:39:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898840861] [2025-02-06 02:39:50,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:50,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:50,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-02-06 02:39:50,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-02-06 02:39:50,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:50,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-02-06 02:39:51,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:51,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898840861] [2025-02-06 02:39:51,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898840861] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:51,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642298297] [2025-02-06 02:39:51,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:51,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:51,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:51,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:39:51,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:39:51,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-02-06 02:39:51,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-02-06 02:39:51,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:51,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:51,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 1362 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:39:51,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-02-06 02:39:51,565 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:39:51,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642298297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:51,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:39:51,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:39:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693297296] [2025-02-06 02:39:51,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:51,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:39:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:51,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:39:51,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:39:51,593 INFO L87 Difference]: Start difference. First operand has 299 states, 217 states have (on average 1.5207373271889402) internal successors, (330), 218 states have internal predecessors, (330), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:39:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:51,661 INFO L93 Difference]: Finished difference Result 584 states and 1037 transitions. [2025-02-06 02:39:51,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:39:51,667 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) Word has length 535 [2025-02-06 02:39:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:51,677 INFO L225 Difference]: With dead ends: 584 [2025-02-06 02:39:51,677 INFO L226 Difference]: Without dead ends: 288 [2025-02-06 02:39:51,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:39:51,683 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:51,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:39:51,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-02-06 02:39:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-02-06 02:39:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 207 states have (on average 1.4927536231884058) internal successors, (309), 207 states have internal predecessors, (309), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-02-06 02:39:51,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 467 transitions. [2025-02-06 02:39:51,738 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 467 transitions. Word has length 535 [2025-02-06 02:39:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:51,738 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 467 transitions. [2025-02-06 02:39:51,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.5) internal successors, (145), 2 states have internal predecessors, (145), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:39:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 467 transitions. [2025-02-06 02:39:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-02-06 02:39:51,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:51,748 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:51,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:39:51,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:39:51,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:51,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -688278362, now seen corresponding path program 1 times [2025-02-06 02:39:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:51,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136551291] [2025-02-06 02:39:51,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:52,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-02-06 02:39:52,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-02-06 02:39:52,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:52,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:39:52,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:52,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136551291] [2025-02-06 02:39:52,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136551291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:52,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:52,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:52,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195748887] [2025-02-06 02:39:52,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:52,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:52,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:52,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:52,454 INFO L87 Difference]: Start difference. First operand 288 states and 467 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:52,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:52,598 INFO L93 Difference]: Finished difference Result 764 states and 1242 transitions. [2025-02-06 02:39:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:52,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 535 [2025-02-06 02:39:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:52,604 INFO L225 Difference]: With dead ends: 764 [2025-02-06 02:39:52,604 INFO L226 Difference]: Without dead ends: 479 [2025-02-06 02:39:52,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:52,607 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 310 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:52,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 906 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-02-06 02:39:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 476. [2025-02-06 02:39:52,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 363 states have (on average 1.5234159779614325) internal successors, (553), 364 states have internal predecessors, (553), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 02:39:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 773 transitions. [2025-02-06 02:39:52,665 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 773 transitions. Word has length 535 [2025-02-06 02:39:52,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:52,666 INFO L471 AbstractCegarLoop]: Abstraction has 476 states and 773 transitions. [2025-02-06 02:39:52,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:52,666 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 773 transitions. [2025-02-06 02:39:52,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-02-06 02:39:52,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:52,676 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:52,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:39:52,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:52,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash -478851992, now seen corresponding path program 1 times [2025-02-06 02:39:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:52,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219109344] [2025-02-06 02:39:52,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:52,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-02-06 02:39:52,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-02-06 02:39:52,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:52,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:39:53,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:53,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219109344] [2025-02-06 02:39:53,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219109344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:53,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:53,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:53,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956403782] [2025-02-06 02:39:53,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:53,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:53,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:53,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:53,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:53,551 INFO L87 Difference]: Start difference. First operand 476 states and 773 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:39:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:53,919 INFO L93 Difference]: Finished difference Result 1422 states and 2313 transitions. [2025-02-06 02:39:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:39:53,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 535 [2025-02-06 02:39:53,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:53,928 INFO L225 Difference]: With dead ends: 1422 [2025-02-06 02:39:53,930 INFO L226 Difference]: Without dead ends: 949 [2025-02-06 02:39:53,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:53,934 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 974 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:53,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 988 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:53,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2025-02-06 02:39:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 482. [2025-02-06 02:39:54,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 369 states have (on average 1.5203252032520325) internal successors, (561), 370 states have internal predecessors, (561), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 02:39:54,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 781 transitions. [2025-02-06 02:39:54,022 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 781 transitions. Word has length 535 [2025-02-06 02:39:54,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:54,025 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 781 transitions. [2025-02-06 02:39:54,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-02-06 02:39:54,026 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 781 transitions. [2025-02-06 02:39:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-02-06 02:39:54,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:54,035 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:54,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:39:54,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:54,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:54,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1695828105, now seen corresponding path program 1 times [2025-02-06 02:39:54,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:54,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048025376] [2025-02-06 02:39:54,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:54,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:54,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-02-06 02:39:54,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-02-06 02:39:54,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:54,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:39:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:54,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048025376] [2025-02-06 02:39:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048025376] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:54,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:54,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3926007] [2025-02-06 02:39:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:54,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:54,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:54,330 INFO L87 Difference]: Start difference. First operand 482 states and 781 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:54,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:54,447 INFO L93 Difference]: Finished difference Result 1344 states and 2174 transitions. [2025-02-06 02:39:54,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:54,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 535 [2025-02-06 02:39:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:54,455 INFO L225 Difference]: With dead ends: 1344 [2025-02-06 02:39:54,455 INFO L226 Difference]: Without dead ends: 865 [2025-02-06 02:39:54,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:54,457 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 386 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:54,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1262 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-02-06 02:39:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 525. [2025-02-06 02:39:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 412 states have (on average 1.5242718446601942) internal successors, (628), 413 states have internal predecessors, (628), 110 states have call successors, (110), 2 states have call predecessors, (110), 2 states have return successors, (110), 109 states have call predecessors, (110), 110 states have call successors, (110) [2025-02-06 02:39:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 848 transitions. [2025-02-06 02:39:54,521 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 848 transitions. Word has length 535 [2025-02-06 02:39:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:54,522 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 848 transitions. [2025-02-06 02:39:54,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 848 transitions. [2025-02-06 02:39:54,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-02-06 02:39:54,557 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:54,557 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:54,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:39:54,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:54,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:54,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1465948598, now seen corresponding path program 1 times [2025-02-06 02:39:54,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:54,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099615606] [2025-02-06 02:39:54,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:54,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:54,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-02-06 02:39:54,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-02-06 02:39:54,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:54,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:55,412 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:39:55,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:55,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099615606] [2025-02-06 02:39:55,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099615606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:55,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:55,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:55,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622351194] [2025-02-06 02:39:55,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:55,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:55,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:55,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:55,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:55,414 INFO L87 Difference]: Start difference. First operand 525 states and 848 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:55,804 INFO L93 Difference]: Finished difference Result 1524 states and 2462 transitions. [2025-02-06 02:39:55,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:39:55,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 535 [2025-02-06 02:39:55,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:55,810 INFO L225 Difference]: With dead ends: 1524 [2025-02-06 02:39:55,810 INFO L226 Difference]: Without dead ends: 1002 [2025-02-06 02:39:55,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:55,812 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 311 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:55,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1341 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2025-02-06 02:39:55,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 710. [2025-02-06 02:39:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 516 states have (on average 1.4844961240310077) internal successors, (766), 517 states have internal predecessors, (766), 189 states have call successors, (189), 4 states have call predecessors, (189), 4 states have return successors, (189), 188 states have call predecessors, (189), 189 states have call successors, (189) [2025-02-06 02:39:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1144 transitions. [2025-02-06 02:39:55,908 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1144 transitions. Word has length 535 [2025-02-06 02:39:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:55,909 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1144 transitions. [2025-02-06 02:39:55,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:55,909 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1144 transitions. [2025-02-06 02:39:55,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-02-06 02:39:55,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:55,917 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:55,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:39:55,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:55,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash -739332256, now seen corresponding path program 1 times [2025-02-06 02:39:55,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:55,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948086041] [2025-02-06 02:39:55,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:55,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:55,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-02-06 02:39:56,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-02-06 02:39:56,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:56,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:39:56,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:56,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948086041] [2025-02-06 02:39:56,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948086041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:56,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:56,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:56,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88989947] [2025-02-06 02:39:56,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:56,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:56,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:56,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:56,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:56,161 INFO L87 Difference]: Start difference. First operand 710 states and 1144 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:56,298 INFO L93 Difference]: Finished difference Result 1277 states and 2059 transitions. [2025-02-06 02:39:56,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:56,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 536 [2025-02-06 02:39:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:56,304 INFO L225 Difference]: With dead ends: 1277 [2025-02-06 02:39:56,304 INFO L226 Difference]: Without dead ends: 755 [2025-02-06 02:39:56,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:56,306 INFO L435 NwaCegarLoop]: 670 mSDtfsCounter, 273 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:56,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1102 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2025-02-06 02:39:56,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 621. [2025-02-06 02:39:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 458 states have (on average 1.4912663755458515) internal successors, (683), 458 states have internal predecessors, (683), 158 states have call successors, (158), 4 states have call predecessors, (158), 4 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-02-06 02:39:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 999 transitions. [2025-02-06 02:39:56,387 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 999 transitions. Word has length 536 [2025-02-06 02:39:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:56,388 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 999 transitions. [2025-02-06 02:39:56,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:56,388 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 999 transitions. [2025-02-06 02:39:56,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-02-06 02:39:56,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:56,401 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:56,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:39:56,401 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:56,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:56,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1223007583, now seen corresponding path program 1 times [2025-02-06 02:39:56,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:56,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110558013] [2025-02-06 02:39:56,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:56,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:56,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-02-06 02:39:56,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-02-06 02:39:56,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:56,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:39:57,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:57,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110558013] [2025-02-06 02:39:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110558013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:57,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:57,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:57,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889987245] [2025-02-06 02:39:57,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:57,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:57,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:57,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:57,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:57,080 INFO L87 Difference]: Start difference. First operand 621 states and 999 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:57,237 INFO L93 Difference]: Finished difference Result 1481 states and 2389 transitions. [2025-02-06 02:39:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 536 [2025-02-06 02:39:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:57,246 INFO L225 Difference]: With dead ends: 1481 [2025-02-06 02:39:57,246 INFO L226 Difference]: Without dead ends: 1048 [2025-02-06 02:39:57,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:57,248 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 269 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:57,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 897 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2025-02-06 02:39:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1046. [2025-02-06 02:39:57,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 802 states have (on average 1.5049875311720697) internal successors, (1207), 802 states have internal predecessors, (1207), 237 states have call successors, (237), 6 states have call predecessors, (237), 6 states have return successors, (237), 237 states have call predecessors, (237), 237 states have call successors, (237) [2025-02-06 02:39:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1681 transitions. [2025-02-06 02:39:57,324 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1681 transitions. Word has length 536 [2025-02-06 02:39:57,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:57,324 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1681 transitions. [2025-02-06 02:39:57,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:57,325 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1681 transitions. [2025-02-06 02:39:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-02-06 02:39:57,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:57,331 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:57,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:39:57,332 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:57,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:57,332 INFO L85 PathProgramCache]: Analyzing trace with hash 502473314, now seen corresponding path program 1 times [2025-02-06 02:39:57,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:57,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389897542] [2025-02-06 02:39:57,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:57,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-02-06 02:39:57,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-02-06 02:39:57,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:57,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:39:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:57,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389897542] [2025-02-06 02:39:57,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389897542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:57,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:57,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:57,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546311356] [2025-02-06 02:39:57,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:57,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:57,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:57,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:57,971 INFO L87 Difference]: Start difference. First operand 1046 states and 1681 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:58,390 INFO L93 Difference]: Finished difference Result 2283 states and 3669 transitions. [2025-02-06 02:39:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:39:58,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 536 [2025-02-06 02:39:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:58,400 INFO L225 Difference]: With dead ends: 2283 [2025-02-06 02:39:58,400 INFO L226 Difference]: Without dead ends: 1415 [2025-02-06 02:39:58,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:58,403 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 355 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:58,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1348 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2025-02-06 02:39:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1343. [2025-02-06 02:39:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1099 states have (on average 1.5386715195632392) internal successors, (1691), 1099 states have internal predecessors, (1691), 237 states have call successors, (237), 6 states have call predecessors, (237), 6 states have return successors, (237), 237 states have call predecessors, (237), 237 states have call successors, (237) [2025-02-06 02:39:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 2165 transitions. [2025-02-06 02:39:58,488 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 2165 transitions. Word has length 536 [2025-02-06 02:39:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:58,489 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 2165 transitions. [2025-02-06 02:39:58,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:58,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2165 transitions. [2025-02-06 02:39:58,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-02-06 02:39:58,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:58,493 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:58,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:39:58,494 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:58,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:58,495 INFO L85 PathProgramCache]: Analyzing trace with hash -518029038, now seen corresponding path program 1 times [2025-02-06 02:39:58,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111895831] [2025-02-06 02:39:58,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:58,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-02-06 02:39:58,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-02-06 02:39:58,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:58,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:39:59,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:59,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111895831] [2025-02-06 02:39:59,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111895831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:59,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:39:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950999846] [2025-02-06 02:39:59,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:59,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:39:59,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:59,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:39:59,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:59,365 INFO L87 Difference]: Start difference. First operand 1343 states and 2165 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:39:59,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:59,972 INFO L93 Difference]: Finished difference Result 4193 states and 6776 transitions. [2025-02-06 02:39:59,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:39:59,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 537 [2025-02-06 02:39:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:59,989 INFO L225 Difference]: With dead ends: 4193 [2025-02-06 02:39:59,989 INFO L226 Difference]: Without dead ends: 2997 [2025-02-06 02:39:59,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:39:59,996 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 556 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:59,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 2031 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:40:00,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2025-02-06 02:40:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2499. [2025-02-06 02:40:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2499 states, 2093 states have (on average 1.5494505494505495) internal successors, (3243), 2093 states have internal predecessors, (3243), 395 states have call successors, (395), 10 states have call predecessors, (395), 10 states have return successors, (395), 395 states have call predecessors, (395), 395 states have call successors, (395) [2025-02-06 02:40:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2499 states to 2499 states and 4033 transitions. [2025-02-06 02:40:00,160 INFO L78 Accepts]: Start accepts. Automaton has 2499 states and 4033 transitions. Word has length 537 [2025-02-06 02:40:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:00,161 INFO L471 AbstractCegarLoop]: Abstraction has 2499 states and 4033 transitions. [2025-02-06 02:40:00,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2499 states and 4033 transitions. [2025-02-06 02:40:00,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:00,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:00,165 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:00,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:40:00,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:00,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:00,168 INFO L85 PathProgramCache]: Analyzing trace with hash -862605842, now seen corresponding path program 1 times [2025-02-06 02:40:00,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:00,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199810012] [2025-02-06 02:40:00,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:00,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:00,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:00,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:00,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:00,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:00,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:40:00,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:00,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199810012] [2025-02-06 02:40:00,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199810012] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:00,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:00,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:40:00,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622460787] [2025-02-06 02:40:00,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:00,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:40:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:00,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:40:00,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:40:00,946 INFO L87 Difference]: Start difference. First operand 2499 states and 4033 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:01,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:01,738 INFO L93 Difference]: Finished difference Result 8129 states and 13115 transitions. [2025-02-06 02:40:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:40:01,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 538 [2025-02-06 02:40:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:01,771 INFO L225 Difference]: With dead ends: 8129 [2025-02-06 02:40:01,772 INFO L226 Difference]: Without dead ends: 6363 [2025-02-06 02:40:01,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:40:01,780 INFO L435 NwaCegarLoop]: 440 mSDtfsCounter, 655 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:01,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1428 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:40:01,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6363 states. [2025-02-06 02:40:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6363 to 6343. [2025-02-06 02:40:02,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6343 states, 5500 states have (on average 1.5614545454545454) internal successors, (8588), 5504 states have internal predecessors, (8588), 819 states have call successors, (819), 23 states have call predecessors, (819), 23 states have return successors, (819), 815 states have call predecessors, (819), 819 states have call successors, (819) [2025-02-06 02:40:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6343 states to 6343 states and 10226 transitions. [2025-02-06 02:40:02,180 INFO L78 Accepts]: Start accepts. Automaton has 6343 states and 10226 transitions. Word has length 538 [2025-02-06 02:40:02,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:02,180 INFO L471 AbstractCegarLoop]: Abstraction has 6343 states and 10226 transitions. [2025-02-06 02:40:02,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:02,181 INFO L276 IsEmpty]: Start isEmpty. Operand 6343 states and 10226 transitions. [2025-02-06 02:40:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:02,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:02,187 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:02,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:40:02,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:02,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2008415467, now seen corresponding path program 1 times [2025-02-06 02:40:02,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:02,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988888809] [2025-02-06 02:40:02,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:02,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:02,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:02,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:02,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:02,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:03,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:40:03,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:03,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988888809] [2025-02-06 02:40:03,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988888809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:03,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:03,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:03,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631464702] [2025-02-06 02:40:03,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:03,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:03,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:03,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:03,158 INFO L87 Difference]: Start difference. First operand 6343 states and 10226 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:03,687 INFO L93 Difference]: Finished difference Result 13165 states and 21215 transitions. [2025-02-06 02:40:03,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:03,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 538 [2025-02-06 02:40:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:03,725 INFO L225 Difference]: With dead ends: 13165 [2025-02-06 02:40:03,725 INFO L226 Difference]: Without dead ends: 7101 [2025-02-06 02:40:03,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:40:03,741 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 672 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:03,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 1345 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:40:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7101 states. [2025-02-06 02:40:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7101 to 6343. [2025-02-06 02:40:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6343 states, 5500 states have (on average 1.557090909090909) internal successors, (8564), 5504 states have internal predecessors, (8564), 819 states have call successors, (819), 23 states have call predecessors, (819), 23 states have return successors, (819), 815 states have call predecessors, (819), 819 states have call successors, (819) [2025-02-06 02:40:04,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6343 states to 6343 states and 10202 transitions. [2025-02-06 02:40:04,052 INFO L78 Accepts]: Start accepts. Automaton has 6343 states and 10202 transitions. Word has length 538 [2025-02-06 02:40:04,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:04,053 INFO L471 AbstractCegarLoop]: Abstraction has 6343 states and 10202 transitions. [2025-02-06 02:40:04,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 6343 states and 10202 transitions. [2025-02-06 02:40:04,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:04,081 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:04,085 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:04,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:40:04,086 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:04,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:04,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1842940406, now seen corresponding path program 1 times [2025-02-06 02:40:04,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:04,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623432553] [2025-02-06 02:40:04,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:04,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:04,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:04,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:04,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:04,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:40:05,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:05,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623432553] [2025-02-06 02:40:05,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623432553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:05,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:05,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748866871] [2025-02-06 02:40:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:05,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:05,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:05,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:05,074 INFO L87 Difference]: Start difference. First operand 6343 states and 10202 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:05,912 INFO L93 Difference]: Finished difference Result 22692 states and 36480 transitions. [2025-02-06 02:40:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:05,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 538 [2025-02-06 02:40:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:05,963 INFO L225 Difference]: With dead ends: 22692 [2025-02-06 02:40:05,963 INFO L226 Difference]: Without dead ends: 16784 [2025-02-06 02:40:05,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:05,982 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 698 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:05,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 1541 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:40:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16784 states. [2025-02-06 02:40:06,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16784 to 12384. [2025-02-06 02:40:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12384 states, 11188 states have (on average 1.557114765820522) internal successors, (17421), 11204 states have internal predecessors, (17421), 1159 states have call successors, (1159), 36 states have call predecessors, (1159), 36 states have return successors, (1159), 1143 states have call predecessors, (1159), 1159 states have call successors, (1159) [2025-02-06 02:40:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12384 states to 12384 states and 19739 transitions. [2025-02-06 02:40:06,598 INFO L78 Accepts]: Start accepts. Automaton has 12384 states and 19739 transitions. Word has length 538 [2025-02-06 02:40:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:06,601 INFO L471 AbstractCegarLoop]: Abstraction has 12384 states and 19739 transitions. [2025-02-06 02:40:06,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:06,602 INFO L276 IsEmpty]: Start isEmpty. Operand 12384 states and 19739 transitions. [2025-02-06 02:40:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:06,611 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:06,612 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:06,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:40:06,612 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:06,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:06,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1073770391, now seen corresponding path program 1 times [2025-02-06 02:40:06,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:06,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524682825] [2025-02-06 02:40:06,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:06,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:06,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:07,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:07,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:07,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:10,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:40:10,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:10,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524682825] [2025-02-06 02:40:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524682825] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:10,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2025-02-06 02:40:10,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49509864] [2025-02-06 02:40:10,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:10,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-06 02:40:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:10,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-06 02:40:10,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:40:10,631 INFO L87 Difference]: Start difference. First operand 12384 states and 19739 transitions. Second operand has 21 states, 21 states have (on average 6.9523809523809526) internal successors, (146), 21 states have internal predecessors, (146), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-02-06 02:40:16,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:16,773 INFO L93 Difference]: Finished difference Result 59096 states and 94172 transitions. [2025-02-06 02:40:16,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 02:40:16,777 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.9523809523809526) internal successors, (146), 21 states have internal predecessors, (146), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 538 [2025-02-06 02:40:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:16,887 INFO L225 Difference]: With dead ends: 59096 [2025-02-06 02:40:16,888 INFO L226 Difference]: Without dead ends: 50606 [2025-02-06 02:40:16,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=324, Invalid=936, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 02:40:16,923 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 7137 mSDsluCounter, 4567 mSDsCounter, 0 mSdLazyCounter, 3946 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7137 SdHoareTripleChecker+Valid, 5038 SdHoareTripleChecker+Invalid, 4274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 3946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:16,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7137 Valid, 5038 Invalid, 4274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 3946 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 02:40:16,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50606 states. [2025-02-06 02:40:18,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50606 to 28624. [2025-02-06 02:40:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28624 states, 26291 states have (on average 1.5611045604959872) internal successors, (41043), 26323 states have internal predecessors, (41043), 2239 states have call successors, (2239), 93 states have call predecessors, (2239), 93 states have return successors, (2239), 2207 states have call predecessors, (2239), 2239 states have call successors, (2239) [2025-02-06 02:40:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28624 states to 28624 states and 45521 transitions. [2025-02-06 02:40:18,383 INFO L78 Accepts]: Start accepts. Automaton has 28624 states and 45521 transitions. Word has length 538 [2025-02-06 02:40:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:18,384 INFO L471 AbstractCegarLoop]: Abstraction has 28624 states and 45521 transitions. [2025-02-06 02:40:18,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.9523809523809526) internal successors, (146), 21 states have internal predecessors, (146), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-02-06 02:40:18,384 INFO L276 IsEmpty]: Start isEmpty. Operand 28624 states and 45521 transitions. [2025-02-06 02:40:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:18,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:18,402 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:18,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:40:18,402 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:18,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:18,404 INFO L85 PathProgramCache]: Analyzing trace with hash -2098464312, now seen corresponding path program 1 times [2025-02-06 02:40:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:18,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235214850] [2025-02-06 02:40:18,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:18,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:21,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:21,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:21,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 18 proven. 216 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:40:21,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235214850] [2025-02-06 02:40:21,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235214850] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:40:21,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040711342] [2025-02-06 02:40:21,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:21,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:21,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:21,691 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:40:21,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:40:21,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:21,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:21,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:21,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:21,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:40:22,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:40:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 5898 proven. 144 refuted. 0 times theorem prover too weak. 6282 trivial. 0 not checked. [2025-02-06 02:40:22,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:40:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 90 proven. 144 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:40:22,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040711342] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:40:22,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:40:22,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-02-06 02:40:22,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477750846] [2025-02-06 02:40:22,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:40:22,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:40:22,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:22,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:40:22,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:40:22,883 INFO L87 Difference]: Start difference. First operand 28624 states and 45521 transitions. Second operand has 10 states, 9 states have (on average 29.0) internal successors, (261), 10 states have internal predecessors, (261), 4 states have call successors, (200), 2 states have call predecessors, (200), 4 states have return successors, (201), 3 states have call predecessors, (201), 4 states have call successors, (201) [2025-02-06 02:40:24,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:24,132 INFO L93 Difference]: Finished difference Result 45064 states and 71669 transitions. [2025-02-06 02:40:24,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:40:24,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 29.0) internal successors, (261), 10 states have internal predecessors, (261), 4 states have call successors, (200), 2 states have call predecessors, (200), 4 states have return successors, (201), 3 states have call predecessors, (201), 4 states have call successors, (201) Word has length 538 [2025-02-06 02:40:24,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:24,184 INFO L225 Difference]: With dead ends: 45064 [2025-02-06 02:40:24,185 INFO L226 Difference]: Without dead ends: 17182 [2025-02-06 02:40:24,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1097 GetRequests, 1075 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=347, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:40:24,218 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 1087 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:24,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1405 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:40:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17182 states. [2025-02-06 02:40:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17182 to 15714. [2025-02-06 02:40:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15714 states, 13887 states have (on average 1.522935119176208) internal successors, (21149), 13919 states have internal predecessors, (21149), 1703 states have call successors, (1703), 123 states have call predecessors, (1703), 123 states have return successors, (1703), 1671 states have call predecessors, (1703), 1703 states have call successors, (1703) [2025-02-06 02:40:25,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15714 states to 15714 states and 24555 transitions. [2025-02-06 02:40:25,227 INFO L78 Accepts]: Start accepts. Automaton has 15714 states and 24555 transitions. Word has length 538 [2025-02-06 02:40:25,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:25,228 INFO L471 AbstractCegarLoop]: Abstraction has 15714 states and 24555 transitions. [2025-02-06 02:40:25,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 29.0) internal successors, (261), 10 states have internal predecessors, (261), 4 states have call successors, (200), 2 states have call predecessors, (200), 4 states have return successors, (201), 3 states have call predecessors, (201), 4 states have call successors, (201) [2025-02-06 02:40:25,229 INFO L276 IsEmpty]: Start isEmpty. Operand 15714 states and 24555 transitions. [2025-02-06 02:40:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:25,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:25,244 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:25,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:40:25,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:25,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:25,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1265012505, now seen corresponding path program 1 times [2025-02-06 02:40:25,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:25,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114081899] [2025-02-06 02:40:25,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:25,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:25,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:25,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:25,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:25,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:40:26,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:26,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114081899] [2025-02-06 02:40:26,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114081899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:26,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:26,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:40:26,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687173651] [2025-02-06 02:40:26,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:26,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:40:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:26,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:40:26,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:40:26,607 INFO L87 Difference]: Start difference. First operand 15714 states and 24555 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:28,307 INFO L93 Difference]: Finished difference Result 31882 states and 49287 transitions. [2025-02-06 02:40:28,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:40:28,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 538 [2025-02-06 02:40:28,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:28,363 INFO L225 Difference]: With dead ends: 31882 [2025-02-06 02:40:28,363 INFO L226 Difference]: Without dead ends: 20128 [2025-02-06 02:40:28,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-06 02:40:28,386 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 1524 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:28,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 2488 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 02:40:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20128 states. [2025-02-06 02:40:29,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20128 to 17942. [2025-02-06 02:40:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17942 states, 15719 states have (on average 1.5088109930657168) internal successors, (23717), 15775 states have internal predecessors, (23717), 2039 states have call successors, (2039), 183 states have call predecessors, (2039), 183 states have return successors, (2039), 1983 states have call predecessors, (2039), 2039 states have call successors, (2039) [2025-02-06 02:40:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17942 states to 17942 states and 27795 transitions. [2025-02-06 02:40:29,420 INFO L78 Accepts]: Start accepts. Automaton has 17942 states and 27795 transitions. Word has length 538 [2025-02-06 02:40:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:29,421 INFO L471 AbstractCegarLoop]: Abstraction has 17942 states and 27795 transitions. [2025-02-06 02:40:29,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 8 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 17942 states and 27795 transitions. [2025-02-06 02:40:29,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:29,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:29,433 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:29,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:40:29,434 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:29,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:29,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1253696378, now seen corresponding path program 1 times [2025-02-06 02:40:29,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:29,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163229876] [2025-02-06 02:40:29,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:29,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:29,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:29,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:29,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:29,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:30,213 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:40:30,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:30,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163229876] [2025-02-06 02:40:30,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163229876] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:30,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:30,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:40:30,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66951055] [2025-02-06 02:40:30,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:30,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:40:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:30,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:40:30,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:40:30,216 INFO L87 Difference]: Start difference. First operand 17942 states and 27795 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:33,383 INFO L93 Difference]: Finished difference Result 63714 states and 98215 transitions. [2025-02-06 02:40:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:40:33,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 538 [2025-02-06 02:40:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:33,520 INFO L225 Difference]: With dead ends: 63714 [2025-02-06 02:40:33,520 INFO L226 Difference]: Without dead ends: 47540 [2025-02-06 02:40:33,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:40:33,555 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1152 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:33,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 1352 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:40:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47540 states. [2025-02-06 02:40:34,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47540 to 17990. [2025-02-06 02:40:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17990 states, 15767 states have (on average 1.5087841694678759) internal successors, (23789), 15823 states have internal predecessors, (23789), 2039 states have call successors, (2039), 183 states have call predecessors, (2039), 183 states have return successors, (2039), 1983 states have call predecessors, (2039), 2039 states have call successors, (2039) [2025-02-06 02:40:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17990 states to 17990 states and 27867 transitions. [2025-02-06 02:40:34,894 INFO L78 Accepts]: Start accepts. Automaton has 17990 states and 27867 transitions. Word has length 538 [2025-02-06 02:40:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:34,895 INFO L471 AbstractCegarLoop]: Abstraction has 17990 states and 27867 transitions. [2025-02-06 02:40:34,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 17990 states and 27867 transitions. [2025-02-06 02:40:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:34,905 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:34,905 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:34,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:40:34,906 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:34,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:34,906 INFO L85 PathProgramCache]: Analyzing trace with hash -386644153, now seen corresponding path program 1 times [2025-02-06 02:40:34,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:34,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382957927] [2025-02-06 02:40:34,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:34,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:34,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:34,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:34,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-02-06 02:40:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382957927] [2025-02-06 02:40:35,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382957927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:35,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:40:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427636169] [2025-02-06 02:40:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:35,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:40:35,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:35,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:40:35,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:35,057 INFO L87 Difference]: Start difference. First operand 17990 states and 27867 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:36,591 INFO L93 Difference]: Finished difference Result 51874 states and 80445 transitions. [2025-02-06 02:40:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:40:36,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 538 [2025-02-06 02:40:36,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:36,678 INFO L225 Difference]: With dead ends: 51874 [2025-02-06 02:40:36,678 INFO L226 Difference]: Without dead ends: 35528 [2025-02-06 02:40:36,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:40:36,708 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 416 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:36,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 1202 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:40:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35528 states. [2025-02-06 02:40:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35528 to 35510. [2025-02-06 02:40:38,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35510 states, 31151 states have (on average 1.4919906263041316) internal successors, (46477), 31263 states have internal predecessors, (46477), 3999 states have call successors, (3999), 359 states have call predecessors, (3999), 359 states have return successors, (3999), 3887 states have call predecessors, (3999), 3999 states have call successors, (3999) [2025-02-06 02:40:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35510 states to 35510 states and 54475 transitions. [2025-02-06 02:40:38,829 INFO L78 Accepts]: Start accepts. Automaton has 35510 states and 54475 transitions. Word has length 538 [2025-02-06 02:40:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:38,830 INFO L471 AbstractCegarLoop]: Abstraction has 35510 states and 54475 transitions. [2025-02-06 02:40:38,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-02-06 02:40:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 35510 states and 54475 transitions. [2025-02-06 02:40:38,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:38,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:38,852 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:38,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 02:40:38,852 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:38,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:38,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1074935846, now seen corresponding path program 1 times [2025-02-06 02:40:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:38,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708320468] [2025-02-06 02:40:38,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:38,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:38,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:40,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:40,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:40,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 57 proven. 177 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:40:40,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708320468] [2025-02-06 02:40:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708320468] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:40:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056426659] [2025-02-06 02:40:40,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:40,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:40,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:40,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:40:40,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:40:40,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:41,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:41,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:41,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:41,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 1359 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:40:41,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:40:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 7640 proven. 177 refuted. 0 times theorem prover too weak. 4507 trivial. 0 not checked. [2025-02-06 02:40:41,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:40:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 57 proven. 177 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:40:42,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056426659] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:40:42,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:40:42,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-02-06 02:40:42,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441066527] [2025-02-06 02:40:42,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:40:42,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:40:42,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:42,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:40:42,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:40:42,319 INFO L87 Difference]: Start difference. First operand 35510 states and 54475 transitions. Second operand has 14 states, 14 states have (on average 22.714285714285715) internal successors, (318), 14 states have internal predecessors, (318), 6 states have call successors, (197), 3 states have call predecessors, (197), 5 states have return successors, (198), 6 states have call predecessors, (198), 6 states have call successors, (198) [2025-02-06 02:40:44,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:44,591 INFO L93 Difference]: Finished difference Result 68620 states and 104889 transitions. [2025-02-06 02:40:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 02:40:44,592 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 22.714285714285715) internal successors, (318), 14 states have internal predecessors, (318), 6 states have call successors, (197), 3 states have call predecessors, (197), 5 states have return successors, (198), 6 states have call predecessors, (198), 6 states have call successors, (198) Word has length 538 [2025-02-06 02:40:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:44,682 INFO L225 Difference]: With dead ends: 68620 [2025-02-06 02:40:44,683 INFO L226 Difference]: Without dead ends: 36266 [2025-02-06 02:40:44,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1090 GetRequests, 1070 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2025-02-06 02:40:44,733 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 1639 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:44,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 988 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:40:44,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36266 states. [2025-02-06 02:40:46,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36266 to 36034. [2025-02-06 02:40:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36034 states, 31544 states have (on average 1.4752092315495815) internal successors, (46534), 31656 states have internal predecessors, (46534), 3999 states have call successors, (3999), 490 states have call predecessors, (3999), 490 states have return successors, (3999), 3887 states have call predecessors, (3999), 3999 states have call successors, (3999) [2025-02-06 02:40:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36034 states to 36034 states and 54532 transitions. [2025-02-06 02:40:46,899 INFO L78 Accepts]: Start accepts. Automaton has 36034 states and 54532 transitions. Word has length 538 [2025-02-06 02:40:46,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:46,899 INFO L471 AbstractCegarLoop]: Abstraction has 36034 states and 54532 transitions. [2025-02-06 02:40:46,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 22.714285714285715) internal successors, (318), 14 states have internal predecessors, (318), 6 states have call successors, (197), 3 states have call predecessors, (197), 5 states have return successors, (198), 6 states have call predecessors, (198), 6 states have call successors, (198) [2025-02-06 02:40:46,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36034 states and 54532 transitions. [2025-02-06 02:40:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-02-06 02:40:46,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:46,916 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:46,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:40:47,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:47,116 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:47,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:47,117 INFO L85 PathProgramCache]: Analyzing trace with hash 50241925, now seen corresponding path program 1 times [2025-02-06 02:40:47,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:47,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644362632] [2025-02-06 02:40:47,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:47,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:47,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:48,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:48,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:48,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:49,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 45 proven. 189 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:40:49,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:49,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644362632] [2025-02-06 02:40:49,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644362632] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:40:49,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294329626] [2025-02-06 02:40:49,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:49,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:40:49,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:40:49,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:40:49,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:40:49,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-02-06 02:40:49,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-02-06 02:40:49,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:49,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:49,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:40:49,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:40:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 6228 proven. 111 refuted. 0 times theorem prover too weak. 5985 trivial. 0 not checked. [2025-02-06 02:40:49,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:40:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 123 proven. 111 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-02-06 02:40:50,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294329626] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:40:50,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:40:50,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 15 [2025-02-06 02:40:50,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069561040] [2025-02-06 02:40:50,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:40:50,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 02:40:50,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:50,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 02:40:50,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-02-06 02:40:50,285 INFO L87 Difference]: Start difference. First operand 36034 states and 54532 transitions. Second operand has 15 states, 14 states have (on average 23.642857142857142) internal successors, (331), 15 states have internal predecessors, (331), 6 states have call successors, (195), 2 states have call predecessors, (195), 4 states have return successors, (196), 6 states have call predecessors, (196), 6 states have call successors, (196) [2025-02-06 02:40:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:55,659 INFO L93 Difference]: Finished difference Result 87944 states and 132181 transitions. [2025-02-06 02:40:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 02:40:55,659 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 23.642857142857142) internal successors, (331), 15 states have internal predecessors, (331), 6 states have call successors, (195), 2 states have call predecessors, (195), 4 states have return successors, (196), 6 states have call predecessors, (196), 6 states have call successors, (196) Word has length 538 [2025-02-06 02:40:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:55,775 INFO L225 Difference]: With dead ends: 87944 [2025-02-06 02:40:55,775 INFO L226 Difference]: Without dead ends: 53638 [2025-02-06 02:40:55,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1110 GetRequests, 1074 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=1104, Unknown=0, NotChecked=0, Total=1406 [2025-02-06 02:40:55,808 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 2678 mSDsluCounter, 3301 mSDsCounter, 0 mSdLazyCounter, 2671 mSolverCounterSat, 1136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2720 SdHoareTripleChecker+Valid, 3955 SdHoareTripleChecker+Invalid, 3807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1136 IncrementalHoareTripleChecker+Valid, 2671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:55,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2720 Valid, 3955 Invalid, 3807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1136 Valid, 2671 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-06 02:40:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53638 states.